Unicyclic graphs with exactly two main eigenvalues
|
|
- Magnus Shepherd
- 5 years ago
- Views:
Transcription
1 Applied Mathematics Letters 19 (006) Unicyclic graphs with exactly two main eigenvalues Yaoping Hou a,,fengtian b a Department of Mathematics, Hunan Normal University Changsha, Hunan , China b Institute of System Sciences, Academy of Math. and System Sci., Beijing , China Received 1 November 005; accepted 1 November 005 Abstract An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one main eigenvalue if and only if it is regular. In this work, all connected unicyclic graphs with exactly two main eigenvalues are determined. c 006 Elsevier Ltd. All rights reserved. Keywords: Spectra of a graph; Main eigenvalues; Unicyclic graphs; Harmonic graphs; -walk linear graphs 1. Introduction Throughout this work, G is a simple graph with vertex set V ={v 1,v,...,v n } and edge set E and adjacency matrix A = A(G) with eigenvalues λ 1,λ,...,λ n. We call λ 1,λ,...,λ n the eigenvalues of G. Aneigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. We denote by m(g) the numberof main eigenvaluesof G.We may indexthe eigenvaluesof G so that the first m(g) are main. It is well known that a graph is regular if and only if it has exactly one main eigenvalue. Along-standing problem posed by Cvetković (see[1]) is that of how to characterize graphs with exactly k (k ) main eigenvalues. Recently, Hagos []gaveanalternative characterization of graphs with exactly two main eigenvalues. The aim of this work is to describe exactly all unicyclic graphs with precisely two main eigenvalues. The organization of this work as follows: in Section we define -walk linear graphs and obtain some basic facts about -walk linear graphs and graphs with exactly two main eigenvalues; and in Section 3, all connected -walk linear unicyclic graphs (i.e., connected unicyclic graphs with exactly two main eigenvalues) are determined.. -walk linear graphs and main eigenvalues For a graph G,thenumber of walks of length k of G starting at v is denoted by d k (v) and the number of all walks in G of length k is denoted by W k = W k (G). Clearly, one has d 0 (v) = 1, d 1 (v) = d(v), thedegree of vertex v, W 0 = n = V, W 1 = E,andd k+1 (v) = u N G (v) d k(u), foreveryintegerk 0, where N G (v) ={u V there is an edge between u and v in G} is theset of all neighbors of v in graph G. Corresponding author. addresses: yphou@hunnu.edu.cn (Y. Hou), ftian@mail.iss.ac.cn (F. Tian) /$ - see front matter c 006 Elsevier Ltd. All rights reserved. doi: /j.aml
2 1144 Y. Hou, F. Tian / Applied Mathematics Letters 19 (006) A graph G is called -walk (a, b)-linear if there exist uniquerationalnumbersa, b such that d (v) = ad(v) + b holds for every vertex v V (G). (1) Remark. In view of the above definition, a -walk linear graph must be irregular, since for an r-regular graph, one has d (v) = rd(v) + 0andalsod (v) = 0d(v) + r. If b = 0, then -walk (a, b)-linear graphs are a-harmonic irregular graphs in [3], and harmonic graphs have been investigated recently [3 5]. Let G be a graph, and let j denote the all-one vector. We call the matrix W(G) = ( j, Aj,...,A n j) the walk-matrix of G. Recently, Hagos [] showedthat Theorem 1 ([,Theorem.1]). The rank of the walk-matrix W(G) is equal to the number of main eigenvalues. Lemma ([, Corollary.3]). If G has exactly m main eigenvalues λ 1,...,λ m,then m p i (A λ p I) j is an eigenvector corresponding to λ i, i = 1,,...,m. In particular, m p=1 (A λ p I) j = 0. Put m := m(g) and M(x) := (x λ 1 )(x λ ) (x λ m ).ItwasshownthatM(x) is arational polynomial [6]. In fact, M(x) is an integral polynomial by the following result. Proposition 3. Let λ 1,λ,...,λ m be all the main eigenvalues of G. Then M(x) = (x λ 1 )(x λ ) (x λ m ) is an integral polynomial. Proof. Since G has exactly m main eigenvalues, the rank of the walk-matrix W(G) is m and j, Aj,...,A m 1 j are linear independent and j, Aj,...,A m 1 j, A m j are dependent. Thus there exist unique rational numbers a 0, a 1,...,a m 1 such that A m j = a 0 j + a 1 Aj + +a m 1 A m 1 j. By Lemma, alla i must be the elementary symmetric functions of λ 1,λ,...,λ m, i = 0, 1,...,m 1. Since λ 1,λ,...,λ m are algebraic integers and the sums and products of algebraic integers are also algebraic integers, a 0, a 1,...,a m 1 are also algebraic integers. Hence, all a i are integers by the rationality of a i for i = 0, 1,..., m 1. In [],Hagos showedthat a graph G has exactlytwo maineigenvaluesif and only if G is -walk linear. Moreover, if G is a -walk (a, b)-linear connected graph, then the two main eigenvalues λ 1,λ of G are λ 1, = a± a +4b,i.e., one has λ 1 + λ = a,λ 1 λ = b.hence, in order to find all graphs with exactly two main eigenvalues, it is sufficient to find all -walk linear graphs. For -walk (a, b)-linear graphs, since (x λ 1 )(x λ ) is an integral polynomial, a and b must be integers. Thus, we have Corollary 4. Let G be a -walk (a, b)-linear graph. Then both a and b are integers. If a -walk linear graph G is connected, then λ 1 λ and a 0. It was shown that a -walk (0, b)-linear graph is bipartite semi-regular [3] and it is easy to see that, if a -walk (0, b)-linear graph has at least one pendent vertex, then it must be a star graph. In [4], all finite and infinite harmonic trees were determined, and it was shown in [5] thatnoconnected irregular unicyclic or bicyclic graphs can be harmonic, and there exist exactly 4 and 16 connected irregular tricyclic and tetracyclic harmonic graphs, respectively. In the next section, we determine all -walk linear connected unicyclic graphs, and hence all connected unicyclic graphs with exactly two main eigenvalues. 3. -walk linear unicyclic graphs For a, the tree T a has been defined in [4] tobethetreewith one vertex v of degree a a + 1while every neighbor of v has degree a and all remaining vertices are pendent. The star graph K 1,n is the tree with n + 1vertices
3 Y. Hou, F. Tian / Applied Mathematics Letters 19 (006) where one central vertex is adjacent to all of the remaining n pendent vertices; and the double star graph S n+1,n+1 is the tree with n + vertices, where two central vertices u,v are adjacent and they are adjacent to exactly n pendent vertices, respectively. It is easy to check that T a is -walk (a, 0)-linear, K 1,n (n ) is -walk (0, n)-linear and S n+1,n+1 is -walk (1, n)-linear. Theorem 5 ([7]). T a,k 1,n (n ), and S n+1,n+1 are the only -walk linear trees. Proof. This follows immediately from the results in [7]. Lemma 6. Let G be a connected and -walk (a, b)-linear graph (a > 0). If a a + b + 1 > 0 and (a a + b + 1) + 4(a 1)b > 0 holds, then d(u) a a + ab + 1 holds for every vertex u V (G), and G has a vertex u with d(u) = a a + ab + 1 if and only if a = 1 and G = S b+1,b+1,ora, b = 0, and G = T a. Proof. Let v 1,v,...,v d(u) be the vertices adjacent to u and let w ij, j = 1,,...,d(v i ) 1beall vertices adjacent to v i other than u. Then, applying Eq. (1) to vertex v i,wehave d(v i ) 1 ad(v i ) + b = d(u) + d(w ij ) d(u) + d(v i ) 1. () j=1 Thus (a 1)d(v i ) d(u) b 1. On the other hand, applying Eq. (1) to vertex u,wehavead(u) + b = d(u) i=1 d(v i). Hence d(u) a(a 1)d(u) + (a 1)b = (a 1) d(v i ) d(u)(d(u) b 1), i=1 that is, d(u) (a a + b + 1)d(u) (a 1)b 0. Since (a a + b + 1) + 4(a 1)b > 0anda a + b + 1 > 0, we have d(u) a a + b (a a + b + 1) + 4(a 1)b a a + b a a + b + 1 +(a 1) b a a + b (a 1) b a a + ab + 1, The above inequalities become equalities if and only if a = 1orb = 0andd(w ij ) = 1forallvertices w ij.if b = 0thenG must be the tree T a by Lemma. of [4]. If a = 1thend(u) = b + 1. By Eq. (),wehaved(v) = 1or d(v) = b + 1for every vertex adjacent to u. Byad(u) + b = v N G (u) d(v), there exists exactly one neighbor of u with degree b + 1. Hence G = S b+1,b+1. Lemma 7. Let G be a connected and -walk (a, b)-linear graph. If G has a vertex u with exactly a + b 1 > 0 pendent vertices, then G = T a in the case a, and G = S b+1,b+1 in the case a = 1. Proof. Since a + b 1 1, a + b. Since d(u) = a + b and u has a + b 1pendent vertices, u has only one more neighbor, say v, thatisnot a pendent vertex. Applying Eq. (1) to the vertex u we have a(a + b) + b = a + b 1 + d(v), that is, d(v) = a a + ab + 1. Since a + b, we have a a + b + 1 (a 1) + > 0and(a a + b + 1) + 4(a 1)b ((a 1) + ) + 4(a 1)( a) = (a 1) (a 1) >0. Therefore Lemma 7 follows from Lemma 6.
4 1146 Y. Hou, F. Tian / Applied Mathematics Letters 19 (006) Lemma 8. Let G be a connected -walk (a, b)-linear graph possessing at least one cycle. Suppose there exists an edge such that G e has two components G 1 and G with G 1 acyclic. Then G 1 has exactly one vertex. Proof. Let w be the vertex of G 1 incident to the edge e; Lemma 8 claims that w is the only vertex of G 1.Assume the opposite, namely that G 1 has vertices other than w. Because G 1 is acyclic, some of thesemust be pendent vertices; choose one of the pendent vertices u that is at the greatest distance from w. Letu be adjacent to vertex x (it is immaterial whether x does or does not coincide with w). Then d(x) = a + b. Among the neighbors of x, ifone belongs to the path connecting w and u and its degree is greater than 1, then all remaining a + b 1vertices must be pendent vertices because otherwise u would not be the vertex at the greatest distance from w. Thus exactly a + b 1 pendent vertices are attached to vertex x. ByLemma 7, G must be the harmonic tree T a or the double star graph S b+1,b+1,whichcontradicts the assumption that G has at least a cycle. The following terminology comes from [8,9]. We call a vertex v in a graph G a bud if v is not a pendent vertex, yet all neighbors of v except at most one are pendent vertices, and a knob if v has exactly two neighbors that are not pendent vertices, and describe as the trunk sk(g) of a graph G the graph obtained by removing all pendent vertices and edges of G. Lemma 7 says that a connected -walk linear graph with at least one bud must be T a or S b+1,b+1. Lemma 8 says that the edge connectivity of the trunk of a connected -walk linear graph with at least a cycle must be more than 1. Lemma 9. Let v 0,v 1,v,v 3,v 4 be a path or a cycle (if v 0 = v 4 )ofa-walklinear graph Gsuchthat v 1,v,v 3 are knobs and v 0,v 4 are not pendent vertices, and let p i = d(v i ), i = 1,, 3,denote the number of pendent vertices adjacent to v i. If p > 0,thend(v 0 ) = d(v 1 ) = d(v ) = d(v 3 ) = d(v 4 ). Proof. Let G be a -walk (a, b)-linear graph. Since p > 0, we have d(v ) = a + b and v has exactly a + b > 0 pendent vertices. Applying Eq. (1) to vertex v we have a + b + d(v 1 ) + d(v 3 ) = a(a + b) + b.sincea 1and a +b 1, 4 a(a +b 1)+ = d(v 1 )+d(v 3 ),where the equality holds if and only if d(v 1 ) = d(v 3 ) =, a = 1 and b =. If d(v 1 ) = d(v 3 ) =, then a = 1, b =. Applying Eq. (1) to v 3 we have a + b + d(v 4 ) = ad(v 3 ) + b. Thus d(v 4 ) = 1, a contradiction to d(v 4 )>1. If d(v 1 ) = a + b and d(v 3 ) =, applying Eq. (1) to vertex v,wehavea + b + a + b + = a(a + b) + b, and therefore (a + b)( a) = b.sincea, b are integers, we have a =, b = 0ora = 0, b = 0, a contradiction. Similarly, the case d(v 3 ) = a + b and d(v 1 ) = wouldyieldacontradiction. Thus, we must have d(v 1 ) = d(v ) = d(v 3 ) = a + b > andhence d(v 0 ) = d(v 1 ) = d(v ) = d(v 3 ) = d(v 4 ) by Eq. (1) Let C r be a cycle of length r; denote by Cr k the graph attained from C r by attaching k 0pendent vertices to every vertex of C r.itiseasy to check that Cr k is -walk (, k)-linear for every integer k > 0. Theorem 10. Thegraphs C k r (k > 0) are the only connected -walk linear unicyclic graphs Proof. If G is a -walk (a, b)-linear graph, then, by Lemma 8, sk(g) contains no pendent vertices, that is, sk(g) = C r for some r.sinceg is not a cycle, G must possess pendent vertices and hence a > 0. Suppose the vertex v possesses at least one pendent vertex, then d(v) = a + b and v has exactly a + b > 0pendent vertices. Case 1: Thelength r of a cycle is at least 4. By Lemma 9, weknow that G must be the graph Cr a+b. Case : The length r of the cycle C r is 3. Let the vertices of the 3-cycle be v, u,w and d(v) = a + b >. If d(u) =, applying Eq. (1) to v and u, wehavea + b + + d(w) = a(a + b) + b and a + b = a + b + d(w), respectively. Hence a(a + b) = a. Sincea > 0, this implies a + b =, a contradiction. Hence d(u) = a + b. Similarly, d(w) = a + b.hence G = C3 a+b. Corollary 11. Thegraphs Cr k (k > 0) are all unicyclic connected graphs with exactly two main eigenvalues. Acknowledgments The authors thank Andreas Dress for his help, Dragan Stevanovićforsending preprints and the referee for careful reading and helpful suggestions. The work was done while Hou was visiting the Academy of Math. and Sys. Sci.,
5 Y. Hou, F. Tian / Applied Mathematics Letters 19 (006) Chinese Academy of Sci., and was supported by NSFC( ) and SRP(03B019) from the Education Committee of Hunan Province. References [1] D. Cvetković, P. Rowlinson, S. Simić, Eigenspaces of Graphs, Cambridge University Press, Cambridge, [] E.M. Hagos, Some results on graph spectra, Linear Algebra Appl. 356 (00) [3] A. Dress, I. Gutman, On the number of walks in a graph, Appl. Math. Lett. 16 (003) [4] S. Grünewald, Harmonic trees, Appl. Math. Lett. 15 (8) (00) [5] B. Borovićanin, S. Grünewald, I. Gutman, M. Petrović, Harmonic graphs with small number of cycles, Discrete Math. 65 (003) [6] D. Cvetković, M. Peterić, A table of connected graphs on six vertices, Discrete Math. 50 (1984) [7] Y. Hou, H. Zhou, Trees with exactly two main eigenvalues, Acta of Hunan Normal University 8 () (005) 1 3 (in Chinese). [8] A. Dress, S. Grünewald, D. Stevanović, Semiharmonic graphs with fixed cyclomatic number, Appl. Math. Lett. 17 (6) (004) [9] A. Dress, S. Grünewald, D. Stevanović, Semiharmonic bicyclic graphs, Appl. Math. Lett. 18 (11) (005)
Spectral radii of graphs with given chromatic number
Applied Mathematics Letters 0 (007 158 16 wwwelseviercom/locate/aml Spectral radii of graphs with given chromatic number Lihua Feng, Qiao Li, Xiao-Dong Zhang Department of Mathematics, Shanghai Jiao Tong
More informationLaplacian spectral radius of trees with given maximum degree
Available online at www.sciencedirect.com Linear Algebra and its Applications 429 (2008) 1962 1969 www.elsevier.com/locate/laa Laplacian spectral radius of trees with given maximum degree Aimei Yu a,,1,
More informationOn the spectral radii of quasi-tree graphs and quasiunicyclic graphs with k pendent vertices
Electronic Journal of Linear Algebra Volume 20 Volume 20 (2010) Article 30 2010 On the spectral radii of quasi-tree graphs and quasiunicyclic graphs with k pendent vertices Xianya Geng Shuchao Li lscmath@mail.ccnu.edu.cn
More informationApplied Mathematics Letters
Applied Mathematics Letters (009) 15 130 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Spectral characterizations of sandglass graphs
More informationA Survey on Comparing Zagreb Indices
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 65 (2011) 581-593 ISSN 0340-6253 A Survey on Comparing Zagreb Indices Bolian Liu and Zhifu You School of
More informationCharacteristic polynomials of skew-adjacency matrices of oriented graphs
Characteristic polynomials of skew-adjacency matrices of oriented graphs Yaoping Hou Department of Mathematics Hunan Normal University Changsha, Hunan 410081, China yphou@hunnu.edu.cn Tiangang Lei Department
More informationThe least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices
Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 22 2013 The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices Ruifang Liu rfliu@zzu.edu.cn
More informationThe Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences. Dedicated to professor Tian Feng on the occasion of his 70 birthday
The Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences Xiao-Dong ZHANG Ü À Shanghai Jiao Tong University xiaodong@sjtu.edu.cn Dedicated to professor Tian Feng on the occasion of his
More informationOn the spectral radius of graphs with cut edges
Linear Algebra and its Applications 389 (2004) 139 145 www.elsevier.com/locate/laa On the spectral radius of graphs with cut edges Huiqing Liu a,meilu b,, Feng Tian a a Institute of Systems Science, Academy
More informationv iv j E(G) x u, for each v V(G).
Volume 3, pp. 514-5, May 01 A NOTE ON THE LEAST EIGENVALUE OF A GRAPH WITH GIVEN MAXIMUM DEGREE BAO-XUAN ZHU Abstract. This note investigates the least eigenvalues of connected graphs with n vertices and
More informationOn the Least Eigenvalue of Graphs with Cut Vertices
Journal of Mathematical Research & Exposition Nov., 010, Vol. 30, No. 6, pp. 951 956 DOI:10.3770/j.issn:1000-341X.010.06.001 Http://jmre.dlut.edu.cn On the Least Eigenvalue of Graphs with Cut Vertices
More informationThe spectral radius of edge chromatic critical graphs
The spectral radius of edge chromatic critical graphs Lihua Feng b, Jianxiang Cao c, Weijun Liu a,b, Shifeng Ding b, Henry Liu b a School of Science, Nantong University, Nantong, Jiangshu, 6019, China.
More informationBicyclic digraphs with extremal skew energy
Electronic Journal of Linear Algebra Volume 3 Volume 3 (01) Article 01 Bicyclic digraphs with extremal skew energy Xiaoling Shen Yoaping Hou yphou@hunnu.edu.cn Chongyan Zhang Follow this and additional
More informationThe chromatic number and the least eigenvalue of a graph
The chromatic number and the least eigenvalue of a graph Yi-Zheng Fan 1,, Gui-Dong Yu 1,, Yi Wang 1 1 School of Mathematical Sciences Anhui University, Hefei 30039, P. R. China fanyz@ahu.edu.cn (Y.-Z.
More informationON THE WIENER INDEX AND LAPLACIAN COEFFICIENTS OF GRAPHS WITH GIVEN DIAMETER OR RADIUS
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 63 (2010) 91-100 ISSN 0340-6253 ON THE WIENER INDEX AND LAPLACIAN COEFFICIENTS OF GRAPHS WITH GIVEN DIAMETER
More informationExtremal Zagreb Indices of Graphs with a Given Number of Cut Edges
Graphs and Combinatorics (2014) 30:109 118 DOI 10.1007/s00373-012-1258-8 ORIGINAL PAPER Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges Shubo Chen Weijun Liu Received: 13 August 2009
More informationEstimating the Spectral Radius of a Graph by the Second Zagreb Index
Estimating the Spectral Radius of a Graph by the Second Zagreb Index Hosam Abdo, Darko Dimitrov Institute of Computer Science, Freie Universität Berlin, Takustraße 9, D 14195 Berlin, Germany abdo@mi.fu-berlin.de,
More informationTHE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER
Kragujevac Journal of Mathematics Volume 38(1 (2014, Pages 173 183. THE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER JIAN-BO LV 1, JIANXI LI 1, AND WAI CHEE SHIU 2 Abstract. The harmonic
More informationOn the spectral radius of bicyclic graphs with n vertices and diameter d
Linear Algebra and its Applications 4 (007) 9 3 www.elsevier.com/locate/laa On the spectral radius of bicyclic graphs with n vertices and diameter d Shu-Guang Guo Department of Mathematics, Yancheng Teachers
More informationOn spectral radius and energy of complete multipartite graphs
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn., ISSN 1855-3974 (electronic edn. ARS MATHEMATICA CONTEMPORANEA 9 (2015 109 113 On spectral radius and energy of complete multipartite
More informationThis article was originally published in a journal published by Elsevier, and the attached copy is provided by Elsevier for the author s benefit and for the benefit of the author s institution, for non-commercial
More informationA lower bound for the harmonic index of a graph with minimum degree at least two
Filomat 7:1 013), 51 55 DOI 10.98/FIL1301051W Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat A lower bound for the harmonic index
More informationThe smallest Randić index for trees
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 123, No. 2, May 2013, pp. 167 175. c Indian Academy of Sciences The smallest Randić index for trees LI BINGJUN 1,2 and LIU WEIJUN 2 1 Department of Mathematics,
More informationThe spectrum of the edge corona of two graphs
Electronic Journal of Linear Algebra Volume Volume (1) Article 4 1 The spectrum of the edge corona of two graphs Yaoping Hou yphou@hunnu.edu.cn Wai-Chee Shiu Follow this and additional works at: http://repository.uwyo.edu/ela
More informationarxiv: v1 [cs.ds] 11 Oct 2018
Path matrix and path energy of graphs arxiv:1810.04870v1 [cs.ds] 11 Oct 018 Aleksandar Ilić Facebook Inc, Menlo Park, California, USA e-mail: aleksandari@gmail.com Milan Bašić Faculty of Sciences and Mathematics,
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 436 (2012) 99 111 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa On weighted directed
More informationarxiv: v1 [math.co] 20 Sep 2014
On some papers of Nikiforov Bo Ning Department of Applied Mathematics, School of Science, Northwestern Polytechnical University, Xi an, Shaanxi 71007, P.R. China arxiv:109.588v1 [math.co] 0 Sep 01 Abstract
More informationNOTE ON THE SKEW ENERGY OF ORIENTED GRAPHS. Communicated by Ivan Gutman. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 4 No. 1 (2015), pp. 57-61. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir NOTE ON THE SKEW ENERGY OF
More informationSome properties of the first general Zagreb index
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 47 (2010), Pages 285 294 Some properties of the first general Zagreb index Muhuo Liu Bolian Liu School of Mathematic Science South China Normal University Guangzhou
More informationELA
A NOTE ON THE LARGEST EIGENVALUE OF NON-REGULAR GRAPHS BOLIAN LIU AND GANG LI Abstract. The spectral radius of connected non-regular graphs is considered. Let λ 1 be the largest eigenvalue of the adjacency
More informationSome spectral inequalities for triangle-free regular graphs
Filomat 7:8 (13), 1561 1567 DOI 198/FIL138561K Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat Some spectral inequalities for triangle-free
More informationAN EXAMPLE OF USING STAR COMPLEMENTS IN CLASSIFYING STRONGLY REGULAR GRAPHS
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.yu/filomat Filomat 22:2 (2008), 53 57 AN EXAMPLE OF USING STAR COMPLEMENTS IN CLASSIFYING STRONGLY REGULAR
More informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 3 No., 018 pp.179-194 DOI: 10.049/CCO.018.685.109 CCO Commun. Comb. Optim. Leap Zagreb Indices of Trees and Unicyclic Graphs Zehui Shao 1, Ivan Gutman,
More informationResolvent Energy of Graphs
Resolvent Energy of Graphs I.Gutman 1,2, B.Furtula 1, E.Zogić 2, E.Glogić 2 1 Faculty of Science, University of Kragujevac, Kragujevac, Serbia 2 State University of Novi Pazar, Novi Pazar, Serbia May 19,
More informationarxiv: v1 [math.co] 5 Sep 2016
Ordering Unicyclic Graphs with Respect to F-index Ruhul Amin a, Sk. Md. Abu Nayeem a, a Department of Mathematics, Aliah University, New Town, Kolkata 700 156, India. arxiv:1609.01128v1 [math.co] 5 Sep
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationNew skew Laplacian energy of a simple digraph
New skew Laplacian energy of a simple digraph Qingqiong Cai, Xueliang Li, Jiangli Song arxiv:1304.6465v1 [math.co] 24 Apr 2013 Center for Combinatorics and LPMC-TJKLC Nankai University Tianjin 300071,
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 436 (2012) 4043 4051 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa On the spectral radius
More informationGraphs determined by their (signless) Laplacian spectra
Electronic Journal of Linear Algebra Volume Volume (011) Article 6 011 Graphs determined by their (signless) Laplacian spectra Muhuo Liu liumuhuo@scau.edu.cn Bolian Liu Fuyi Wei Follow this and additional
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationOn trees with smallest resolvent energies 1
On trees with smallest resolvent energies 1 Mohammad Ghebleh, Ali Kanso, Dragan Stevanović Faculty of Science, Kuwait University, Safat 13060, Kuwait mamad@sci.kuniv.edu.kw, akanso@sci.kuniv.edu.kw, dragance106@yahoo.com
More informationOn sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs
On sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs Saieed Akbari 1,2 Ebrahim Ghorbani 1,2 Jacobus H. Koolen 3,4 Mohammad Reza Oboudi 1,2 1 Department of Mathematical Sciences
More informationOn the difference between the revised Szeged index and the Wiener index
On the difference between the revised Szeged index and the Wiener index Sandi Klavžar a,b,c M J Nadjafi-Arani d June 3, 01 a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia sandiklavzar@fmfuni-ljsi
More informationEQUIENERGETIC GRAPHS
5 Kragujevac J. Math. 26 (2004) 5 13. EQUIENERGETIC GRAPHS Harishchandra S. Ramane, 1 Hanumappa B. Walikar, 2 Siddani Bhaskara Rao, 3 B. Devadas Acharya, 4 Prabhakar R. Hampiholi, 1 Sudhir R. Jog, 1 Ivan
More informationarxiv: v2 [math.co] 27 Jul 2013
Spectra of the subdivision-vertex and subdivision-edge coronae Pengli Lu and Yufang Miao School of Computer and Communication Lanzhou University of Technology Lanzhou, 730050, Gansu, P.R. China lupengli88@163.com,
More informationSolutions to Unsolved Problems on the Minimal Energies of Two Classes of Graphs
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 66 (2011) 943-958 ISSN 0340-6253 Solutions to Unsolved Problems on the Minimal Energies of Two Classes of
More informationLAPLACIAN ESTRADA INDEX OF TREES
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 63 (009) 769-776 ISSN 0340-653 LAPLACIAN ESTRADA INDEX OF TREES Aleksandar Ilić a and Bo Zhou b a Faculty
More informationarxiv: v1 [math.co] 30 Dec 2015
Resolvent Energy of Unicyclic, Bicyclic and Tricyclic Graphs arxiv:1512.08938v1 [math.co] 30 Dec 2015 Luiz Emilio Allem 1, Juliane Capaverde 1, Vilmar Trevisan 1, Abstract Ivan Gutman 2,3, Emir Zogić 3,
More information(Received: 19 October 2018; Received in revised form: 28 November 2018; Accepted: 29 November 2018; Available Online: 3 January 2019)
Discrete Mathematics Letters www.dmlett.com Discrete Math. Lett. 1 019 1 5 Two upper bounds on the weighted Harary indices Azor Emanuel a, Tomislav Došlić b,, Akbar Ali a a Knowledge Unit of Science, University
More informationCOUNTING RELATIONS FOR GENERAL ZAGREB INDICES
Kragujevac Journal of Mathematics Volume 38(1) (2014), Pages 95 103. COUNTING RELATIONS FOR GENERAL ZAGREB INDICES G. BRITTO ANTONY XAVIER 1, E. SURESH 2, AND I. GUTMAN 3 Abstract. The first and second
More informationOrdering trees by their largest eigenvalues
Linear Algebra and its Applications 370 (003) 75 84 www.elsevier.com/locate/laa Ordering trees by their largest eigenvalues An Chang a,, Qiongxiang Huang b a Department of Mathematics, Fuzhou University,
More informationSpectral Characterization of Generalized Cocktail-Party Graphs
Journal of Mathematical Research with Applications Nov., 01, Vol. 3, No. 6, pp. 666 67 DOI:10.3770/j.issn:095-651.01.06.005 Http://jmre.dlut.edu.cn Spectral Characterization of Generalized Cocktail-Party
More informationCospectral graphs and the generalized adjacency matrix
Linear Algebra and its Applications 42 2007) 41 www.elsevier.com/locate/laa Cospectral graphs and the generalized adjacency matrix E.R. van Dam a,1, W.H. Haemers a,, J.H. Koolen b,2 a Tilburg University,
More informationOn the distance spectral radius of unicyclic graphs with perfect matchings
Electronic Journal of Linear Algebra Volume 27 Article 254 2014 On the distance spectral radius of unicyclic graphs with perfect matchings Xiao Ling Zhang zhangxling04@aliyun.com Follow this and additional
More informationLinear Algebra and its Applications
Linear Algebra and its Applications xxx (2008) xxx xxx Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Graphs with three distinct
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationThe Local Spectra of Regular Line Graphs
The Local Spectra of Regular Line Graphs M. A. Fiol a, M. Mitjana b, a Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya Barcelona, Spain b Departament de Matemàtica Aplicada I
More informationOn the harmonic index of the unicyclic and bicyclic graphs
On the harmonic index of the unicyclic and bicyclic graphs Yumei Hu Tianjin University Department of Mathematics Tianjin 30007 P. R. China huyumei@tju.edu.cn Xingyi Zhou Tianjin University Department of
More informationA note on the Laplacian Estrada index of trees 1
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 63 (2009) 777-782 ISSN 0340-6253 A note on the Laplacian Estrada index of trees 1 Hanyuan Deng College of
More informationTopological indices: the modified Schultz index
Topological indices: the modified Schultz index Paula Rama (1) Joint work with Paula Carvalho (1) (1) CIDMA - DMat, Universidade de Aveiro The 3rd Combinatorics Day - Lisboa, March 2, 2013 Outline Introduction
More informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 1 No. 2, 2016 pp.137-148 DOI: 10.22049/CCO.2016.13574 CCO Commun. Comb. Optim. On trees and the multiplicative sum Zagreb index Mehdi Eliasi and Ali
More informationMinimizing the Laplacian eigenvalues for trees with given domination number
Linear Algebra and its Applications 419 2006) 648 655 www.elsevier.com/locate/laa Minimizing the Laplacian eigenvalues for trees with given domination number Lihua Feng a,b,, Guihai Yu a, Qiao Li b a School
More informationBipartite graphs with at most six non-zero eigenvalues
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 11 (016) 315 35 Bipartite graphs with at most six non-zero eigenvalues
More informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationDistance spectral radius of trees with fixed maximum degree
Electronic Journal of Linear Algebra Volume 20 Volume 20 (200) Article 3 200 Distance spectral radius of trees with fixed maximum degree Dragan Stevanovic Aleksandar Ilic aleksandari@gmail.com Follow this
More informationBulletin T.CXXII de l Académie Serbe des Sciences et des Arts Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 26
Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts - 001 Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 6 SOME SPECTRAL PROPERTIES OF STARLIKE TREES M. LEPOVIĆ, I.
More informationOn oriented graphs with minimal skew energy
Electronic Journal of Linear Algebra Volume 7 Article 61 014 On oriented graphs with minimal skew energy Shi-Cai Gong Zhejiang A & F University, scgong@zafueducn Xueliang Li Nankai University, lxl@nankaieducn
More informationThe minimum rank of matrices and the equivalence class graph
Linear Algebra and its Applications 427 (2007) 161 170 wwwelseviercom/locate/laa The minimum rank of matrices and the equivalence class graph Rosário Fernandes, Cecília Perdigão Departamento de Matemática,
More informationarxiv: v1 [math.co] 27 Nov 2014
Extremal matching energy of complements of trees Tingzeng Wu a,,1, Weigen Yan b,2, Heping Zhang c,1 a School of Mathematics and Statistics, Qinghai Nationalities University, Xining, Qinghai 810007, P.
More informationGraph fundamentals. Matrices associated with a graph
Graph fundamentals Matrices associated with a graph Drawing a picture of a graph is one way to represent it. Another type of representation is via a matrix. Let G be a graph with V (G) ={v 1,v,...,v n
More informationNullity of Hermitian-Adjacency Matrices of Mixed Graphs
Journal of Mathematical Research with Applications Jan., 2018, Vol. 38, No. 1, pp. 23 33 DOI:10.3770/j.issn:2095-2651.2018.01.002 Http://jmre.dlut.edu.cn Nullity of Hermitian-Adjacency Matrices of Mixed
More informationApplicable Analysis and Discrete Mathematics available online at GRAPHS WITH TWO MAIN AND TWO PLAIN EIGENVALUES
Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.rs Appl. Anal. Discrete Math. 11 (2017), 244 257. https://doi.org/10.2298/aadm1702244h GRAPHS WITH TWO MAIN AND TWO PLAIN
More informationSpectral results on regular graphs with (k, τ)-regular sets
Discrete Mathematics 307 (007) 1306 1316 www.elsevier.com/locate/disc Spectral results on regular graphs with (k, τ)-regular sets Domingos M. Cardoso, Paula Rama Dep. de Matemática, Univ. Aveiro, 3810-193
More informationDiscrete Mathematics
Discrete Mathematics 3 (0) 333 343 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc The Randić index and the diameter of graphs Yiting Yang a,
More informationExtremal trees with fixed degree sequence for atom-bond connectivity index
Filomat 26:4 2012), 683 688 DOI 10.2298/FIL1204683X Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Extremal trees with fixed degree
More informationImproved bounds on the difference between the Szeged index and the Wiener index of graphs
Improved bounds on the difference between the Szeged index and the Wiener index of graphs Sandi Klavžar a,b,c M. J. Nadjafi-Arani d October 5, 013 a Faculty of Mathematics and Physics, University of Ljubljana,
More informationEnergies of Graphs and Matrices
Energies of Graphs and Matrices Duy Nguyen T Parabola Talk October 6, 2010 Summary 1 Definitions Energy of Graph 2 Laplacian Energy Laplacian Matrices Edge Deletion 3 Maximum energy 4 The Integral Formula
More informationOn the Randić Index of Polyomino Chains
Applied Mathematical Sciences, Vol. 5, 2011, no. 5, 255-260 On the Randić Index of Polyomino Chains Jianguang Yang, Fangli Xia and Shubo Chen Department of Mathematics, Hunan City University Yiyang, Hunan
More informationRoot systems and optimal block designs
Root systems and optimal block designs Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, UK p.j.cameron@qmul.ac.uk Abstract Motivated by a question
More informationA lower bound for the spectral radius of graphs with fixed diameter
A lower bound for the spectral radius of graphs with fixed diameter Sebastian M. Cioabă Department of Mathematical Sciences, University of Delaware, Newark, DE 19716, USA e-mail: cioaba@math.udel.edu Edwin
More informationThe effect on the algebraic connectivity of a tree by grafting or collapsing of edges
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 855 864 www.elsevier.com/locate/laa The effect on the algebraic connectivity of a tree by grafting or collapsing
More informationKey words: matching polynomial; acyclic polynomial; matching generating polynomial; perfect matching; Hosoya index; Pfaffian orientation
On the Matching Polynomials of Graphs with Small Number of Cycles of Even Length WEIGEN YAN,, YEONG-NAN YEH, FUJI ZHANG 3 School of Sciences, Jimei University, Xiamen 360, China Institute of Mathematics,
More informationExtremal Kirchhoff index of a class of unicyclic graph
South Asian Journal of Mathematics 01, Vol ( 5): 07 1 wwwsajm-onlinecom ISSN 51-15 RESEARCH ARTICLE Extremal Kirchhoff index of a class of unicyclic graph Shubo Chen 1, Fangli Xia 1, Xia Cai, Jianguang
More informationOn the distance signless Laplacian spectral radius of graphs and digraphs
Electronic Journal of Linear Algebra Volume 3 Volume 3 (017) Article 3 017 On the distance signless Laplacian spectral radius of graphs and digraphs Dan Li Xinjiang University,Urumqi, ldxjedu@163.com Guoping
More informationCharacterization of Graphs with Large Nullity
Characterization of Graphs with Large Nullity å79 +² uà ŒÆ 1 1 36 Contents Definition Background Problem Nullity on Bipartite Graphs Tree, Unicyclic Graph and Bicyclic Graph Graphs with small nullity Graphs
More informationWhen can the components of NEPS of connected bipartite graphs be almost cospectral?
When can the components of NEPS of connected bipartite graphs be almost cospectral? Dragan Stevanović Department of Mathematics, Faculty of Science, Ćirila i Metodija 2, Niš 18000, Yugoslavia dragance@pmf.pmf.ni.ac.yu
More informationELA A NOTE ON GRAPHS WHOSE LARGEST EIGENVALUE OF THE MODULARITY MATRIX EQUALS ZERO
A NOTE ON GRAPHS WHOSE LARGEST EIGENVALUE OF THE MODULARITY MATRIX EQUALS ZERO SNJEŽANA MAJSTOROVIĆ AND DRAGAN STEVANOVIĆ Abstract. Informally, a community within a graph is a subgraph whose vertices are
More informationWiener Index of Graphs and Their Line Graphs
JORC (2013) 1:393 403 DOI 10.1007/s40305-013-0027-6 Wiener Index of Graphs and Their Line Graphs Xiaohai Su Ligong Wang Yun Gao Received: 9 May 2013 / Revised: 26 August 2013 / Accepted: 27 August 2013
More informationSome Bounds on General Sum Connectivity Index
Some Bounds on General Sum Connectivity Index Yun Gao Department of Editorial, Yunnan Normal University, Kunming 65009, China, gy6gy@sinacom Tianwei Xu, Li Liang, Wei Gao School of Information Science
More informationThe Distance Spectrum
The Distance Spectrum of a Tree Russell Merris DEPARTMENT OF MATHEMATICS AND COMPUTER SClENCE CALlFORNlA STATE UNlVERSlN HAYWARD, CAL lfornla ABSTRACT Let T be a tree with line graph T*. Define K = 21
More informationThe Singular Acyclic Matrices of Even Order with a P-Set of Maximum Size
Filomat 30:13 (016), 3403 3409 DOI 1098/FIL1613403D Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat The Singular Acyclic Matrices of
More informationON EQUIENERGETIC GRAPHS AND MOLECULAR GRAPHS
Kragujevac J. Sci. 29 2007) 73 84. UDC 541.66:547.318 ON EQUIENERGETIC GRAPHS AND MOLECULAR GRAPHS Hanumappa B. Walikar, a Harishchandra S. Ramane, b Ivan Gutman, c Sabeena B. Halkarni a a Department of
More informationNormalized Laplacian spectrum of two new types of join graphs
Journal of Linear and Topological Algebra Vol. 6, No. 1, 217, 1-9 Normalized Laplacian spectrum of two new types of join graphs M. Hakimi-Nezhaad a, M. Ghorbani a a Department of Mathematics, Faculty of
More informationDiscrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability
Discrete Mathematics 310 (010 1167 1171 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The average degree of a multigraph critical with respect
More informationDRAGAN STEVANOVIĆ. Key words. Modularity matrix; Community structure; Largest eigenvalue; Complete multipartite
A NOTE ON GRAPHS WHOSE LARGEST EIGENVALUE OF THE MODULARITY MATRIX EQUALS ZERO SNJEŽANA MAJSTOROVIĆ AND DRAGAN STEVANOVIĆ Abstract. Informally, a community within a graph is a subgraph whose vertices are
More informationEnergy of Graphs. Sivaram K. Narayan Central Michigan University. Presented at CMU on October 10, 2015
Energy of Graphs Sivaram K. Narayan Central Michigan University Presented at CMU on October 10, 2015 1 / 32 Graphs We will consider simple graphs (no loops, no multiple edges). Let V = {v 1, v 2,..., v
More informationThe Normalized Laplacian Estrada Index of a Graph
Filomat 28:2 (204), 365 37 DOI 0.2298/FIL402365L Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat The Normalized Laplacian Estrada
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationRemarks on dynamic load balancing of integer loads and integral graphs
Remarks on dynamic load balancing of integer loads and integral graphs Dragan Stevanović University of Niš, Faculty of Sciences and Mathematics, Višegradska, 18000 Niš, Serbia and University of Primorska,
More informationarxiv: v1 [math.co] 17 Apr 2018
On extremal cacti with respect to the edge revised Szeged index arxiv:180.06009v1 [math.co] 17 Apr 2018 Shengjie He a, Rong-Xia Hao a, Deming Li b a Department of Mathematics, Beijing Jiaotong University,
More information