DOCSLIB.ORG

Schultz Energy of Some Graph

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Schultz Energy of Some Graph INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 11, NOVEMBER 2019 ISSN 2277-8616 Schultz Energy Of Some Graph M. R. Rajesh Kanna, R. Jagadeesh , H. L. Parashivamurthy Abstract : In this article we defined Schultz energy [1]. By using of the adjacency degree and distance matrices. This article contains computation of Schultz energies for some standard graphs like star graph, complete graph, crown graph, cocktail graph, complete bipartite graph and friendship graphs. At the end of this article upper and lower bounds for Schultz energy are also presented. Index Terms: Schultz matrix, Schultz eigenvalues, Schultz energy. ———————————————————— 1 INTRODUCTION 1.2 Schultz energy Study on energy of graphs goes back to the year 1978, when Let G be a simple graph of order n with vertex set V and edge I. Gutman [12] defined this while working with energies of set E(G). Let d(v )denotes the degree of the vertexv . Schultz conjugated hydrocarbon containing carbon atoms. All graphs matrix of a graph G is n × nmatrix and is defined by S(G) ≔ considered in this paper are assumed to be simple without (s ), where loops and multiple edges. Let A = (a ) be the adjacency matrix s = [d(v ) + d(v )] d(v , v ). of the graph G with its eigenvalues λ , λ , λ , … , λ assumed in The characteristic polynomial of S(G) is denoted by decreasing order. Since A is real symmetric, the eigenvalues f (G, ρ) = det (ρI − S(G)). of G are real numbers whose sum equal to zero. The sum of The Schultz eigenvalues of the graph G are the eigenvalues the absolute eigenvalues values of G is called the energy E(G) ofS(G) . Since S(G) is real and symmetric, its eigenvalues are of G. real numbers and we label them in non-increasing order ρ ≥ ρ ≥ ρ ≥ ⋯ ≥ ρ . The Schultz energy of G is defined as i. e. , ℇ(G) = ∑|λ |. ℇ (G) ≔ ∑|ρ | Theories on the mathematical concepts of graph energy can be seen in there views [13], papers [8, 9, 14] and the Here trace of S(G) = 0. references cited there in. For various upper and lower bounds for energy of a graph can be found in papers [8, 9] and it was 2 MAIN RESULTS AND DISCUSSION observed that graph energy has chemical applications in the molecular orbital theory of conjugated molecules [15, 16]. 2.1 Properties of Schultz eigenvalues Theorem 2.1 Let G be a graph with vertex set V = 1.1 Schultz index *v , v , … , v +, edge set E. If λ , λ , λ , … , λ are the eigenvalues In 1989, H.P. Schultz [23] introduced a new topological index, of Schultz matrix S(G) then namely Schultz index which is defined as 푆(퐺) = ∑ [푑(푣 ) + 푑(푣 )] 푑(푣 , 푣 ). (i) ∑ λ = 0 (ii) ∑ λ = ∑(d + d ) . { , } ( ) Proof i) We know that the sum of the eigenvalues of S(G) is the where d(v , v ) is the shortest distance between vertices v and trace of S(G). v , and d(v ) is thedegree of the vertex v in G, Similarly d(v ). A. Dobrynin and Amide A. Kochetova in 1994 [1] also ∴ ∑ λ = ∑ s = 0. proposed the above index and called it the degree distance of a graph. (ii) Similarly the sum of squares of the eigenvalues of S(G) is trace of ,S(G)- ∴ ∑ λ = ∑ ∑ s s ________________________ = ∑(s ) + ∑ s s Rajesh Kanna. M. R Department of Mathematics, Sri D D Urs Government First Grade College, Hunsur, India, PH - 09448150508. E-mail: [email protected] Government Science College (Autonomous), Nrupathunga Road, = ∑(s ) + 2 ∑(s ) Bangalore - 560 001, India PH-9110296180. E-mail: [email protected] Parashivamurthy H. L. S Research scholar, department of = ∑(s ) + 2 ∑([d(v ) + d(v )]d(v , v )) Mathematics, Bharathiar University, Coimbatore- 641046, India / Department of Mathematics, BGS Institute of Technology, Adichunchanagiri University, B.G. Nagar-571448, Nagamangala, = 2 ∑(d + d ) d Mandya District, India. PH - 9900262656. Email: [email protected] = 2M, where = ∑(d + d ) d 25 IJSTR©2019 www.ijstr.org INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 11, NOVEMBER 2019 ISSN 2277-8616 2.2 Bounds for Schultz energy a graph, an upper bound for ℇ (G) is given in the following MClelland's [20] gave upper and lower bounds for ordinary theorem. energy of a graph. Similar bounds for ℇ (G) are given in the following theorem. ∑ ( ) Theorem 2.4 If G is a (n, m) graph with ( ) ≥ n Theorem 2.2 Let G be a simple graph with n vertices and m Then edges and P = |detS(G)| then ℇ (G) 2 ∑ (d + d ) d √2 ∑(d + d ) d + n(n − 1)P ≤ ℇ (G) ≤ ( ) n 2 ∑ (d + d ) d 2 ∑ (d + d ) d + √(n − 1) [ − ( )] ≤ √n (2 ∑(d + d ) d ) . n n Proof Proof Cauchy Schwarz inequality is Cauchy-schwartz inequality is [∑ a ] ≤ (∑ a ) (∑ b ) (∑ a b ) ≤ (∑ a ) (∑ b ) Put If a = 1, b = |λ | then (∑ λ ) ≤ (∑ 1) (∑ λ ) | | | | | | a = 1, b = λ then (∑ λ ) + (∑ 1) (∑ λ ) ,ℇ (G)- ≤ n (2 ∑(d + d ) d ) . , ( ) - ( ) ℇ G − λ ≤ n − 1 (2 ∑(d + d ) d ) − λ [From theorem 2.1] ℇ (G) ≤ λ + √(n − 1) (2 ∑(d + d ) d ) − λ ⇛ ℇ (G) ≤ √n (2 ∑(d + d ) d ) . Since arithmetic mean is greater than or equal to geometric mean we have Let f(x) = x + √(n − 1) (2 ∑(d + d ) d ) − x ( ) 1 ∑|λ | |λ | ≥ *∏|λ ||λ |+ n(n − 1) For decreasing function f (x) ≤ 0 = x(n − 1) 1 − ≤ 0 ( ) ( ) √(n − 1) .2 ∑ (d + d ) d / − x = [∏|λ | ] = [∏|λ |] 2 ∑ (d + d ) d = |∏ λ | = |detS(G)| = P ⇛ x ≥ √ n Type equation here. Now consider, ,ℇ (G)- ≤ (∑|λ |) 2 ∑ (d + d ) d 2 ∑ (d + d ) d since ( ) ≥ n, we have√ n n = ∑|λ | + ∑|λ ||λ | 2 ∑ (d + d ) d ≤ ≤ λ n √ ℇ (G) ≥ 2 ∑ (d + d ) d + n(n − 1)P . 2 ∑ (d + d ) d ∴ f(λ ) ≤ f ( ) n Theorem 2.3 If λ (G) is the largest minimum Schultz ( ) 2 ∑ (d + d ) d eigenvalues of S(G) then λ (G) ≥ . i. e. , ℇ (G) ≤ f(λ ) ≤ f ( ) n Proof For any non zero vector X, we have by[3], λ (A) = 2 ∑ (d + d ) d max * } i. e. , ℇ (G) ≤ f ( ) n J AJ 2 ∑ (d + d )d ∴ λ (G) = = J J n S(G) = where J is unit column matrix. n Just like Koolen and Moulton’s [19] upper bound for energy of 26 IJSTR©2019 www.ijstr.org INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 11, NOVEMBER 2019 ISSN 2277-8616 i. e. , ℇ (G) ∑ b + rR ∑ a ≤ (r + R) ∑ a b 2 ∑ (d + d ) d ≤ n Put b = |λ |, a = 1, r = |λ | and R = |λ | then 2 ∑ (d + d ) d + √(n − 1) *2 ∑(d + d ) d − ( ) + ∑|λ | |λ ||λ | ∑ 1 ≤ ( |λ | + |λ |) ∑|λ | n i. e. , 2 ∑(d + d ) d + |λ ||λ |n ≤ (|λ | + |λ |)ℇ (G) Milovanovi’c [21] bounds for minimum Schultz energy of a graph are given in the following theorem. 2 ∑ (d + d ) d + n|λ ||λ | ∴ ℇ (G) ≥ (|λ | + |λ |) Theorem 2.5.Let G be a graph with n vertices and m edges. The question of when does the graph energy becomes a Let |λ | ≥ |λ | ≥ ⋯ ≥ |λ | be a non-increasing order of Schultz rational number was answered by Bapat and S. Pati in their eighenvalue of S(G) then paper [4]. similar result for Schultz energy is obtained in the following theorem. ℇ (G) ≥ √n .∑ (d + d ) d / − α(n)(|λ | − |λ |) n 1 n Theorem 2.7.If the minimum Schultz energy ℇ (G) is a rational where ∝ (n) = n 0 1 (1 − 0 1) 2 n 2 number then ℇ (G) = |C|(mod2). and ,x-denotes the integral part of the real number Proof is similar to theorem 3.7 of [2] Proof For real numbers a,a , a , … , a , A and b, b , b , … , b ,B with a≤ a ≤ A and b ≤ b ≤ ∀ i = 1,2. n the following 2.3 Schultz energy of some standard graphs inequality is valid. Theorem 2.8 For n≥ 2, the Schultz energy of some complete |n ∑ a b − ∑ a ∑ b | ≤∝ (n)(A − a)(B − b)where ∝ (n) graph K is 4(n − 1) . n 1 n = n 0 1 (1 − 0 1) Proof Let K be a complete graph with vertex set V 2 n 2 ={v1,v2,v3,…..,vn}. Then the Schultz matrix of complete graph and equality holds if and only if a = a = ⋯ = a and b = is, b =. = b . If a = |λ |, b = |λ |, a = b = |λ | and A=B=|λ |, then |n ∑|λ | − (∑|λ |) | ≤ ∝ (n)(|λ | − |λ |) But Characteristics polynomial is ∑|λ | = 2 ∑(d + d ) d and ℇ (G) (−1) ,λ − 2(n − 1) -,λ + 2(n − 1)- . Characteristics equation is (−1) ,λ − 2(n − 1) -,λ + 2(n − 1)- = 0. 2(n − 1) −2(n − 1) ≥ √n (2 ∑(d + d ) d ) Spec(K ) = . / 1 n − 1 The Schultz energy is, then the above inequality becomes ℇ (K ) = |2(n − 1) |(1) + |−2(n − 1)|(n − 1) ℇ (K ) = 2(n − 1) + 2(n − 1) ℇ (K ) = 4(n − 1) . n (2 ∑(d + d ) d ) − (ℇ (G)) ≤ ∝ (n)(|λ | − |λ |) Theorem 2.9.The Schultz energy of star graph K , is 4 if n = 2 { i. e. , ℇ (G) ≥ √n (2 ∑(d + d ) d ) −∝ (n)(|λ | − |λ |) 4(n − 2) + √n + 3n − 16n + 16 if n > 2 Theorem 2.6 Let G be a graph with n vertices and m edges. Proof Let K , be a star graph with vertex set V={v0,v1,v2,..,vn-1}.
Load more

Recommended publications
  • Results on Domination Number and Bondage Number for Some Families of Graphs
    International Journal of Pure and Applied Mathematics Volume 107 No. 3 2016, 565-577 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu AP doi: 10.12732/ijpam.v107i3.5 ijpam.eu RESULTS ON DOMINATION NUMBER AND BONDAGE NUMBER FOR SOME FAMILIES OF GRAPHS G. Hemalatha1, P. Jeyanthi2 § 1Department of Mathematics Shri Andal Alagar College of Engineering Mamandur, Kancheepuram, Tamil Nadu, INDIA 2Research Centre, Department of Mathematics Govindammal Aditanar College for Women Tiruchendur 628 215, Tamil Nadu, INDIA Abstract: Let G = (V, E) be a simple graph on the vertex set V . In a graph G, A set S ⊆ V is a dominating set of G if every vertex in VS is adjacent to some vertex in S. The domination number of a graph Gγ(G)] is the minimum size of a dominating set of vertices in G. The bondage number of a graph G[Bdγ(G)] is the cardinality of a smallest set of edges whose removal results in a graph with domination number larger than that of G. In this paper we establish domination number and the bondage number for some families of graphs. AMS Subject Classification: 05C69 Key Words: dominating set, bondage number, domination number, cocktail party graph, coxeter graph, crown graph, cubic symmetric graph, doyle graph, folkman graph, levi graph, icosahedral graph 1. Introduction The domination in graphs is one of the major areas in graph theory which attracts many researchers because it has the potential to solve many real life problems involving design and analysis of communication network, social net- Received: October 17, 2015 c 2016 Academic Publications, Ltd.
    [Show full text]
  • Constructing Arbitrarily Large Graphs with a Specified Number Of
    Electronic Journal of Graph Theory and Applications 4 (1) (2019), 1–8 Constructing Arbitrarily Large Graphs with a Specified Number of Hamiltonian Cycles Michael Haythorpea aSchool of Computer Science, Engineering and Mathematics, Flinders University, 1284 South Road, Clovelly Park, SA 5042, Australia michael.haythorpe@flinders.edu.au Abstract A constructive method is provided that outputs a directed graph which is named a broken crown graph, containing 5n − 9 vertices and k Hamiltonian cycles for any choice of integers n ≥ k ≥ 4. The construction is not designed to be minimal in any sense, but rather to ensure that the graphs produced remain non-trivial instances of the Hamiltonian cycle problem even when k is chosen to be much smaller than n. Keywords: Hamiltonian cycles, Graph Construction, Broken Crown Mathematics Subject Classification : 05C45 1. Introduction The Hamiltonian cycle problem (HCP) is a famous NP-complete problem in which one must determine whether a given graph contains a simple cycle traversing all vertices of the graph, or not. Such a simple cycle is called a Hamiltonian cycle (HC), and a graph containing at least one arXiv:1902.10351v1 [math.CO] 27 Feb 2019 Hamiltonian cycle is said to be a Hamiltonian graph. Typically, randomly generated graphs (such as Erdos-R˝ enyi´ graphs), if connected, are Hamil- tonian and contain many Hamiltonian cycles. Although HCP is an NP-complete problem, for these graphs it is often fairly easy for a sophisticated heuristic (e.g. see Concorde [1], Keld Helsgaun’s LKH [4] or Snakes-and-ladders Heuristic [2]) to discover one of the multitude of Hamiltonian cy- cles through a clever search.
    [Show full text]
  • Prime Labeling of Union Graphs
    International Journal of Scientific Research in _____________________________ Research Paper . Mathematical and Statistical Sciences Vol.6, Issue.1, pp.86-93, February (2019) E-ISSN: 2348-4519 DOI: https://doi.org/10.26438/ijsrmss/v6i1.8693 Prime labeling of Union Graphs S K Patel1, A N Kansagara2* 1 Department of Mathematics, Government Engineering College, Bhuj-370 001. India. 2 Department of Mathematics, Shree D K V Arts and Science College, Jamnagar-361 008. India. *Corresponding author: [email protected] Tel: +91 94267 57504 Available online at: www.isroset.org Received: 01/Feb/2019, Accepted: 11/Feb/2019, Online: 28/Feb/2019 Abstract- A graph with vertices is called prime graph if its vertices can be labeled with first positive integers such that each pair of adjacent vertices have relatively prime labels. Such a labeling is called prime labeling. It is known that graphs like gear graphs, crown graphs, helm graphs, book graphs and are prime. In this paper, we study the prime labeling of union of these graphs. Keyword: Prime labeling, union of graphs, Corona product, Cartesian Product. AMS Subject Classification(2010): 05C7 I. INTRODUCTION (iii) whereas and are odd integers (iv) , where is any integer. All graphs considered in this paper are simple, finite, and 2. undirected. For a graph , and denotes the 3. , where is an odd integer. vertex set and edge set of respectively whereas 4. For arbitrary integers if and denotes the cardinality of the respective sets. For , then . terms not defined here, we refer the reader to [6]. Paths and cycles are the immediate examples of Now we discuss some basic definions which will be used in prime graphs but on the other hand the conjecture that trees main results.
    [Show full text]
  • Smith Forms for Adjacency Matrices of Circulant Graphs
    Smith forms for adjacency matrices of circulant graphs Gerald Williamsa aDepartment of Mathematical Sciences, University of Essex, Colchester, Essex CO4 3SQ, U.K. Abstract We calculate the Smith normal form of the adjacency matrix of each of the following graphs or their complements (or both): complete graph, cycle graph, square of the cycle, power graph of the cycle, distance matrix graph of cycle, Andr´asfaigraph, Doob graph, cocktail party graph, crown graph, prism graph, M¨obiusladder. The proofs operate by finding the abelianisation of a cyclically presented group whose relation matrix is column equivalent to the required adjacency matrix. Keywords: Smith normal form, circulant graph, adjacency matrix. 2000 MSC: 05C50, 15A21, 20F05. 1. Introduction The circulant matrix circn(a0; : : : ; an−1) is the n × n matrix whose first row is (a0; : : : ; an−1) and where row (i+1) (0 ≤ i ≤ n−2) is a cyclic shift of row i by one column. A circulant graph is a graph that is isomorphic to a graph whose adjacency matrix is circulant. We shall write A(Γ) for the adjacency matrix of a graph Γ. Given graphs Γ; Γ0 if det(A(Γ)) =6 det(A(Γ0)) (in particular if precisely one of A(Γ), A(Γ0) is singular) then Γ; Γ0 are non-isomorphic. Similarly, if rank(A(Γ)) =6 rank(A(Γ0)) then Γ; Γ0 are non-isomorphic. Singularity, rank, and determinants of various families of circulant graphs are considered (for example) in [3],[7],[16],[23]. For an n × n integer matrix M, the Smith normal form of M, written SNF(M), is the n × n diagonal integer matrix S = diagn(d0; : : : ; dn−1) where d0; : : : ; dn−1 2 N [ f0g and dijdi+1 (0 ≤ i ≤ n − 2) is such that there exist invertible integer matrices P; Q such that PMQ = S.
    [Show full text]
  • Pattern Avoidance and Fiber Bundle Structures on Schubert Varieties
    Thursday 2.10 Auditorium B Pattern Avoidance and Fiber Bundle Structures on Schubert Varieties Timothy Alland [email protected] SUNY Stony Brook (This talk is based on joint work with Edward Richmond.) MSC2000: 05E15, 14M15 Permutations are known to index type A Schubert varieties. A question one can ask regarding a specific Schubert variety is whether it is an iterated fiber bundle of Grass- mannian Schubert varieties, that is, if it has a complete parabolic bundle structure. We have found that a Schubert variety has a complete parabolic bundle structure if and only if its associated permutation avoids the patterns 3412, 52341, and 635241. We find this by first identifying when the standard projection from the Schubert variety in the complete flag variety to the Schubert variety in the Grassmannian is a fiber bundle using what we have called \split pattern avoidance". In this talk, I will demonstrate how we were able to move from a characterization of this projection in terms of the support and left descents of the permutation's parabolic decomposition to one that applies split pattern avoidance. I will also give a flavor of the proof of how the three patterns mentioned above determine whether a Schubert variety has a complete parabolic bundle structure. Monday 3.55 Auditorium B A simple proof of Shamir's conjecture Peter Allen [email protected] LSE (This talk is based on joint work with Julia B¨ottcher, Ewan Davies, Matthew Jenssen, Yoshiharu Kohayakawa, Barnaby Roberts.) MSC2000: 05C80 It is well known (and easy to show) that the threshold for a perfect matching in the bino- log n mial random graph G(n; p) is p = Θ n , coinciding with the threshold for every vertex to be in an edge (and much more is known).
    [Show full text]
  • Arxiv:2108.05223V2 [Math.CO] 12 Aug 2021 the Line Graph of the Crown
    The line graph of the crown graph is distance integral S. Morteza Mirafzal Department of Mathematics Lorestan University, Khorramabad, Iran E-mail: [email protected] E-mail: [email protected] Abstract The distance eigenvalues of a connected graph G are the eigenvalues of its distance matrix D(G). A graph is called distance integral if all of its distance eigenvalues are integers. Let n ≥ 3 be an integer. A crown graph Cr(n) is a graph obtained from the complete bipartite graph Kn,n by removing a perfect matching. Let L(Cr(n)) denote the line graph of the crown graph Cr(n). In this paper, by using the orbit partition method in algebraic graph theory, we determine the set of all distance eigenvalues of L(Cr(n)) and show that this graph is distance integral. 1 Introduction and Preliminaries arXiv:2108.05223v4 [math.CO] 8 Sep 2021 In this paper, a graph G = (V, E) is considered as an undirected simple graph where V = V (G) is the vertex-set and E = E(G) is the edge-set. For all the terminology and notation not defined here, we follow [3,4,5,6,7]. Let G = (V, E) be a graph and A = A(G) be an adjacency matrix of G. The characteristic polynomial of G is defined as P (G; x)= P (x)= |xI − A|. A zero of p(x) is called an eigenvalue of the graph G. A graph is called integral, if all the eigenvalues are integers. The study of integral graphs was initiated by 2010 Mathematics Subject Classification:05C50 Keywords: crown graph, distance integral, vertex-transitive, orbit partition Date: 1 2 S.
    [Show full text]
  • Bidirected Graph from Wikipedia, the Free Encyclopedia Contents
    Bidirected graph From Wikipedia, the free encyclopedia Contents 1 Bidirected graph 1 1.1 Other meanings ............................................ 1 1.2 See also ................................................ 2 1.3 References ............................................... 2 2 Bipartite double cover 3 2.1 Construction .............................................. 3 2.2 Examples ............................................... 3 2.3 Matrix interpretation ......................................... 4 2.4 Properties ............................................... 4 2.5 Other double covers .......................................... 4 2.6 See also ................................................ 5 2.7 Notes ................................................. 5 2.8 References ............................................... 5 2.9 External links ............................................. 6 3 Complex question 7 3.1 Implication by question ........................................ 7 3.2 Complex question fallacy ....................................... 7 3.2.1 Similar questions and fallacies ................................ 8 3.3 Notes ................................................. 8 4 Directed graph 10 4.1 Basic terminology ........................................... 11 4.2 Indegree and outdegree ........................................ 11 4.3 Degree sequence ............................................ 12 4.4 Digraph connectivity .......................................... 12 4.5 Classes of digraphs .........................................
    [Show full text]
  • On Balance Index Set of Double Graphs and Derived Graphs
    International Journal of Mathematics and Soft Computing Vol.4, No.2 (2014), 81 - 93. ISSN Print : 2249 - 3328 ISSN Online: 2319 - 5215 On Balance Index Set of Double graphs and Derived graphs Pradeep G. Bhat, Devadas Nayak Department of Mathematics Manipal Institute of Technology Manipal University, Manipal-576 104, India. E-mail: pg−[email protected], [email protected] Abstract In this paper we obtain Balance Index Set of the double graphs and the derived graphs of path graphs, cycle graphs, wheel graphs, complete bipartite graphs, star graphs, double star, crown graphs, helm graphs and flower graphs. Keywords: Friendly labeling, partial edge labeling, balance index set, double graphs and derived graphs. AMS Subject Classification(2010): 05C78. 1 Introduction We begin with simple, finite, connected and undirected graph G=(V; E). Here elements of set V and E are known as vertices and edges respectively. For all other terminologies and notations we follow Harary [1]. Definition 1.1. Double graph of a connected graph G is constructed by taking two copies of G say G0 and G00, join each vertex u0 in G0 to the neighbour of the corresponding u00 in G00. Double graph of G is denoted by D2(G). Definition 1.2. The derived graph of G, denoted by Gy is a graph with vertex set V (G), in which two vertices are adjacent if and only if their distance in G is two. Definition 1.3. The crown Cn K1 is obtained by joining a pendant edge to each vertex of Cn. Definition 1.4. The wheel Wn is defined to be the join K1 + Cn.
    [Show full text]
  • A Study on Color Energy of Graphs
    A Study on Color Energy of Graphs A Dissertation Submitted in Partial Fulfillment of the Requirements for the Award of the Degree of Master of Philosophy in Mathematics by Prajakta Bharat Joshi (Reg. No. 1640036) Under the Guidance of Mayamma Joseph Professor Department of Mathematics CHRIST UNIVERSITY BENGALURU, INDIA November 2017 Approval of Dissertation Dissertation entitled A Study on Color Energy of Graphs by Prajakta Bharat Joshi, Reg. No. 1640036 is approved for the award of the degree of Master of Philosophy in Mathematics. Examiner: Supervisor: Chairman: GRC: Date: Place: Bengaluru ii DECLARATION I, Prajakta Bharat Joshi, hereby declare that the dissertation, titled A Study on Color Energy of Graphs is a record of original research work undertaken by me for the award of the degree of Master of Philosophy in Mathematics. I have completed this study under the supervision of Dr Mayamma Joseph, Professor, Department of Mathematics. I also declare that this dissertation has not been submitted for the award of any degree, diploma, associateship, fellowship or other title. I hereby confirm the originality of the work and that there is no plagiarism in any part of the dissertation. Place: Bengaluru Date: Prajakta Bharat Joshi Reg. No. 1640036 Department of Mathematics Christ University, Bengaluru. iii CERTIFICATE This is to certify that the dissertation submitted by Prajakta Bharat Joshi, Reg. No. 1640036, titled A Study on Color Energy of Graphs is a record of research work done by her during the academic year 2016-2017 under my supervision in partial fulfillment for the award of Master of Philosophy in Mathematics.
    [Show full text]
  • On the Representation Number of a Crown Graph Arxiv:1609.00674V1
    On the representation number of a crown graph Marc Glen1, Sergey Kitaev1, and Artem Pyatkin2 1Department of Computer and Information Sciences, University of Strathclyde, 26 Richmond Street, Glasgow G1 1XH, UK 2Sobolev Institute of Mathematics, Novosibirsk State University, 630090 Novosibirsk, Russia Abstract A graph G = (V; E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w if and only if xy is an edge in E. It is known that any word-representable graph G is k-word-representable for some k, that is, there exists a word w representing G such that each letter occurs exactly k times in w. The minimum such k is called G's representation number. A crown graph Hn;n is a graph obtained from the complete bipar- tite graph Kn;n by removing a perfect matching. In this paper we show that for n ≥ 5, Hn;n's representation number is dn=2e. This result not only provides a complete solution to the open Problem 7.4.2 in [3], but also gives a negative answer to the question raised in Problem 7.2.7 in [3] on 3-word-representability of bipartite graphs. As a byproduct we obtain a new example of a graph class with a high representation number. arXiv:1609.00674v1 [math.CO] 2 Sep 2016 Keywords: word-representable graph, crown graph, representation number 1 Introduction A graph G = (V; E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w if and 1 only if xy is an edge in E.
    [Show full text]
  • Minimum Covering Distance Energy of a Graph 1 Introduction
    Applied Mathematical Sciences, Vol. 7, 2013, no. 111, 5525 - 5536 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2013.38477 Minimum Covering Distance Energy of a Graph M. R. Rajesh Kanna, B. N. Dharmendra Department of Mathematics Maharani’s Science College for Women J. L. B. Road, Mysore - 570 005, India [email protected], [email protected] R. Pradeep Kumar Research and Development Centre Bharathiar University Coimbatore 641 046, India [email protected] Copyright c 2013 M. R. Rajesh Kanna, B. N. Dharmendra and R. Pradeep Kumar. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract Recently Prof.Chandrashekar Adiga et al.[1] have defined the minimum covering energy, EC (G) of a graph G which depends on its particular minimum cover C. Motivated by this paper, we introduced the concept of minimum covering distance energy ECd(G) of a graph G and computed minimum covering distance energies of a star graph, complete graph, crown graph, bipartite graph and cocktail graphs. Upper and lower bounds for ECd(G) are also established. Mathematics Subject Classification: 05C50, 05C69 Keywords: Minimum covering set, Minimum covering distance matrix, Minimum covering distance eigenvalues, Minimum covering distance energy of a graph 1 Introduction The concept of energy of a graph was introduced by I. Gutman [10] in the year 1978. Let G be a graph with n vertices {v1,v2, ..., vn} and m edges. Let A =(aij) be the adjacency matrix of the 5526 M.
    [Show full text]
  • Structural Aspects of Switching Classes
    Structural Aspects of Switching Classes Structural Aspects of Switching Classes Proefschrift ter verkrijging van de graad van Doctor aan de Universiteit Leiden, op gezag van de Rector Magni¯cus Dr. D.D. Breimer, hoogleraar in de faculteit der Wiskunde en Natuurwetenschappen en die der Geneeskunde, volgens besluit van het College voor Promoties te verdedigen op woensdag 26 september 2001 te klokke 14.15 uur Jurriaan Hage geboren te Alphen aan den Rijn in 1969 Promotiecommissie Promotor: Prof. dr. G. Rozenberg Co-promotor: Dr. T. Harju (Turun Yliopisto, Finland) Referent: Prof. dr. H.-J. Kreowski (UniversitÄat Bremen, Duitsland) Overige leden: Prof. dr. H. Ehrig (Technische UniversitÄat Berlin, Duitsland) Prof. dr. E. Welzl (ETH ZÄurich, Zwitserland) Dr. J. Engelfriet Prof. dr. J. Kok Prof. dr. H.A.G. Wijsho® The work in this thesis was carried within the context of the IPA graduate school. And then there was light... Contents 1 Introduction 11 2 Preliminaries 15 2.1 Sets, functions and relations ....................... 15 2.2Basicgrouptheory............................ 16 2.3Basicgraphtheory............................ 22 I Switching Classes of Graphs 27 3 Switching Classes 29 3.1De¯nitions................................. 29 3.2Basicpropertiesofswitchingclasses.................. 32 3.3 Two-graphs . ............................... 37 3.4Somecomplexityconsiderations..................... 37 3.4.1 Easyproblemsforswitchingclasses............... 38 3.4.2 Hardproblemsforswitchingclasses.............. 40 3.4.3 Theembeddingproblem....................
    [Show full text]