BOUNDS FOR LAPLACIAN SPECTRAL RADIUS OF THE COMPLETE BIPARTITE GRAPH
|
|
- Horace Melvyn McCoy
- 5 years ago
- Views:
Transcription
1 Volume 115 No , ISSN: (printed version); ISSN: (on-line version) url: ijpam.eu BOUNDS FOR LAPLACIAN SPECTRAL RADIUS OF THE COMPLETE BIPARTITE GRAPH Malathy.V 1 and Kalyani Desikan Department of Mathematics, SAS,VIT University 1 malathy.viswanathan015@vit.ac.in, kalyanidesikan@vit.ac.in August 9, 017 ABSTRACT: Let G be a simple graph with n vertices and m edges and G c be its complement. Let δ(g) = δ and (G) = be the minimum degree and the maximum degree of vertices of G, respectively. In this paper we present a sharp upper bound for the Laplacian spectral radius of complete bipartite graph K r,s for s r as λ 1 (G) s+ s +8rs and for r = s, λ 1 (G) = s. We prove the upper bound of Nordhaus - Gaddum type relation on the Laplacian spectral radius of this graph as λ 1 (G) + λ 1 (G c ) s+ s +8rs + (s 1) (3s 1). KEY WORDS : Laplacian spectral radius, Complete bipartite graph, Nordhaus - Gaddum. AMS Subject Classification : 05C50. 1 INTRODUCTION Let G = (V, E) be a simple undirected graph with n vertices and m edges. The complement G c of the graph G is the graph with the same vertex set as G, where any two distinct vertices are adjacent 343
2 if and only if they are non adjacent in G. For v V, the degree of v, written by d(v), is the number of edges incident with v. Let δ(g) = δ and (G) = be the minimum degree and the maximum degree of vertices of G, respectively. Moreover, we will use the symbols u adj v and u nadj v to denote u and v are adjacent or not adjacent, respectively. Let A(G) be the adjacency matrix of G and D(G) = diag (d(v 1 ), d(v ),..., d(v n )) be the diagonal matrix of vertex degrees. The Laplacian matrix of G is L(G) = D(G) - A(G). Clearly, L(G) is a real symmetric matrix. From this fact and Gergorins Theorem, it follows that its eigenvalues are nonnegative real numbers. The largest eigenvalue of Laplacian matrix of graph G denoted as λ 1 (G) is the Laplacian spectral radius of G. Let G be a graph with the degree diagonal matrix D(G) and adjacency matrix A(G).The signless Laplacian matrix of G is denoted as Q(G) = D(G) + A(G).The largest eigenvalue of signless Laplacian matrix of G denoted as λ 1 (Q) is the signless Laplacian spectral radius of G. Some upper bounds for λ 1 (G) were given by Anderson and Morley [], Li and Zhang [6, 8], Merris [11] and Rojo et al[15]. Shi [10] applies Nordhaus - Gaddum type relations for some important classes of graphs and derives the sharp bounds. 1.1 PRELIMINARIES Before stating and proving our results, we present basic definitions and preliminary results which will be used for the subsequent discussions. Definition 1. A graph G = (V,E) in which V can be partitioned into two subsets V 1 and V so that each edge in G connects some vertex in V 1 to some vertex in V is a bipartite graph. A bipartite simple graph is called complete if each vertex in V 1 is connected to each vertex in V. If V 1 = r and V = s, the corresponding complete bipartite graph is represented as K r,s. Example We shall illustrate the complete bipartite graph K 3,4 and its complement which comprises of disjoint union of K 3 and K
3 Figure 1: Complete bipartite graph K 3,4 and its complement K 3 and K 4. Theorem. [4] Let G be a graph. Then λ 1 (G) λ 1 (Q) (1) Moreover, if G is connected, then the equality holds if and only if G is a bipartite graph. Theorem 3. [4] Let B be a real symmetric nxn matrix, and let λ be an eigenvalue of B with an eigenvector x all of whose entries are nonnegative. Denote the ith row sum of B by s i (B). Then min s i(b) λ max s i(b). () 1 i n 1 i n Theorem 4. [4] Let G be an n-vertex graph, Q = Q(G) and P any polynomial. Then min s v(p (Q)) P (λ 1 (Q)) max s v(p (Q)) (3) v V (G) v V (G) Theorem 5. [4]. Let G be a simple graph with n vertices and m edges. Let δ and be the minimum degree and the maximum degree of G, respectively, and λ 1 (G) be the Laplacian spectral radius of G. Then λ 1 (G) ( + δ 1) ( + δ 1) + 4(4m δ(n 1)) Moreover, if G is connected, then the equality holds if and only if G is a regular bipartite graph. (4) 345
4 Corollary 6. [1] Let G be a graph with connected components G i for (1 i l). Then the spectrum of G is the union of the spectra of G i (and multiplicities are added). The same holds for the Laplacian and the signless Laplacian spectrum. Corollary 7. [1] The multiplicity of 0 as a Laplacian eigenvalue of an undirected graph G equals the number of connected components of G. Corollary 8. [1] Let the undirected graph G be regular of valency k. Then k is the largest eigenvalue of G and its multiplicity equals the number of connected components of G. Corollary 9. [1] A graph G is bipartite if and only if the Laplacian spectrum and the signless Laplacian spectrum of G are equal. Corollary 10. [1] Let G be the complete graph K n on n vertices. Its spectrum has the {(n 1) 1, ( 1) n 1 }. The Laplacian matrix has spectrum {0 1, n n 1 }. Corollary 11. [1] The spectrum of the complete bipartite graph K m,n is {± mn, 0 m+n }. The Laplacian spectrum is {0 1, m n 1, n m 1, (m + n) 1 }. Main Results We now apply these results to the complete bipartite graph to state and prove our main results. We obtain the bound for complete bipartite graph by making use of the numbers r and s, which are the minimum and maximum degree of the graph. Theorem 1. Let G = (V,E) be the complete bipartite graph whose vertex set V can be partitioned into two subsets V 1 and V, where V 1 = r and V = s, for r s, and λ 1 (G) be the Laplacian spectral radius of G. Then r + (r + 8rs) λ 1 (G) s + (s + 8rs) (5) 346
5 Moreover, if G is a complete bipartite graph then equality holds and λ 1 (G) = s for r = s. Proof. We first prove the theorem for λ 1 (Q). Since Q = D + A, we have s v (Q) = d(v). Note that s v (AD) = s v (A ) = Σ d(v) u adj v is true for the complete bipartite graph G. Then Hence, for every v V (G), s v (Q ) = s v (D(D + A) + AD + A ) = d v s v (Q) + ( Σ d(v)) u adj v = d v s v (Q) + (m d(v) Σ d(v)) u nadj v, u v ss v (Q) + (m s (r 1)s) = ss v (Q) + (rs s rs + s) = ss v (Q) + rs. s v (Q ) ss v (Q) rs 0. By theorem 4, λ 1 (Q) sλ 1 (Q) rs 0. Solving the quadratic inequality, we obtain By theorem, we have Similarly, taking the upper bound i.e λ 1 (Q) s + s + 8rs. (6) λ 1 (G) s + s + 8rs. (7) s v (Q ) = s v (D(D + A) + AD + A ) = d v s v (Q) + ( Σ u adj v d(v)) = d v s v (Q) + (m d(v) Σ d(v)) u nadj v, u v rs v (Q) + (m r (s 1)r) = rs v (Q) + (rs r (s 1)r) = s v (Q rs v (Q) rs 0. = s v (Q ) rs v (Q) rs. 347
6 Solving the quadratic inequality and by theorem 4, we get λ 1 (Q) r + r + 8rs. (8) λ 1 (G) r + r + 8rs Hence, from equations (7) and (9), we get the result. (9) Consider the Complete bipartite graph K r,s given in the figure 1, here r = 3 and s = 4. So according to theorem 1, the bounds are 6.64 λ 1 (G) where the actual calculated value of λ 1 (G) = 7. Theorem 13. Let G = (V,E) be the complete bipartite graph whose vertex set V can be partitioned into two subsets V 1 and V, where V 1 = r and V = s, for r s, and λ 1 (G) be the Laplacian spectral radius of G.Then the complement G c is a disjoint union of G 1 and G, where G 1 is the complete graph K r and G is the complete graph K s. Then λ 1 (G) + λ 1 (G c ) 3s 1. Proof. The complete bipartite graph K r,s has K r and K s as the complement. The Laplacian spectrum of the disjoint union of G i components, for (1 i l) is the union of Laplacian spectrum of G 1, G...G l. Let {0 = α 1, α...α r } be the spectrum of graph G 1 and {0 = β 1, β...β s } be the spectrum of graph G, then spectrum G 1 + G is the multiset {α 1, α...α r, β 1, β...β s }. Then from [1], we have λ 1 {G 1 G...G l } = max {λ 1 (G 1 ) λ 1 (G ),...λ 1 (G l )}. Here G 1 = K r and G = K s. Hence, we have As r s, λ 1 (G c ) = λ 1 {G 1 G } = max {(r 1 ), (s 1) }= (s 1 ). (10) λ 1 (G) s + (s + 8rs) s + (s + 8s ) = s. (11) 348
7 Hence, λ 1 (G) + λ 1 (G c ) s + (s 1 )= 3s 1. References [1] Andries E. Brouwer, Willem H. Haemers, Spectra of graphs, Monographs, February 1, 011. [] W.N. Anderson, T.D. Morley, Eigenvalues of the Laplacian of a graph, Linear and Multilinear Algebra, 18 (1985) [3] M.N. Ellingham, X. Zha, The spectral radius of graphs on surfaces, J. Combin. Theory Ser., B 78(000) [4] Huiqing Liu, Mei Lu, Feng Tian,On the Laplacian spectral radius of a graph, Linear algebra and its application, 376 (004) [5] Y. Hong, X. Zhang, Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees, Discrete Math., 96 (005) [6] J.-S. Li, Y.-L. Pan, de Canes inequality and bounds on the largest Laplacian eigenvalue of a graph, Linear Algebra Appl., 38 (001) [7] J.-S. Li, X.-D. Zhang, A new upper bound for eigenvalues of the Laplacian matrix of a graph, Linear Algebra Appl., 65 (1997) [8] J.-S. Li, X.-D. Zhang, On the Laplacian eigenvalues of a graph, Linear Algebra Appl., 85 (1998) [9] X.L. Li, The relations between the spectral radius of the graphs and their complement, J. North China Technol. Inst., 17 (4) (1996) [10] Lingsheng Shi, Bounds on the (Laplacian)spectral radius of graphs, Linear algebra and its application, 4(007)
8 [11] R. Merris, A note on Laplacian graph eigenvalues, Linear Algebra Appl., 85 (1998) [1] Michael William Newman, Master thesis, Department of Mathematics University of Manitoba Winnipeg, July 1, 000. [13] E.A. Nordhaus, J.M. Gaddum, On complementary graphs,amer. Math.Monthly, 63 (1956) [14] E. Nosal, Eigenvalues of graphs, Masters Thesis, University of Calgary, [15] O. Rojo, R. Soto, H. Rojo, An always non-trivial upper bound for Laplacian graph eigenvalues, Linear Algebra Appl., 31 (000) [16] J.L. Shu, Y. Hong, W.R. Kai, A sharp bound on the largest eigenvalue of the Laplacian matrix of a graph, Linear Algebra Appl., 347 (00) [17] X.D Zhang, R. Luo, The spectral radius of triangle-free graphs, Australas. J. Combin. 6 (00)
9 351
10 35
This 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 informationJournal of Science and Arts Year 17, No. 1(38), pp , 2017
Journal of Science and Arts Year 17, No. 1(38), pp. 49-60, 2017 BOUNDS FOR THE ENERGY OF ( ) ORIGINAL PAPER ( ) USING 2-ADJACENCY SERIFE BUYUKKOSE 1, SEMIHA BASDAS NURKAHLI 1, NURSAH MUTLU 1 Manuscript
More informationImproved Upper Bounds for the Laplacian Spectral Radius of a Graph
Improved Upper Bounds for the Laplacian Spectral Radius of a Graph Tianfei Wang 1 1 School of Mathematics and Information Science Leshan Normal University, Leshan 614004, P.R. China 1 wangtf818@sina.com
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 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 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 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 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 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 informationA New Spectral Technique Using Normalized Adjacency Matrices for Graph Matching 1
CHAPTER-3 A New Spectral Technique Using Normalized Adjacency Matrices for Graph Matching Graph matching problem has found many applications in areas as diverse as chemical structure analysis, pattern
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 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 informationSpectral radius of bipartite graphs
Linear Algebra and its Applications 474 2015 30 43 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Spectral radius of bipartite graphs Chia-an
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 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 informationSpectra of the blow-up graphs
Spectra of the blow-up graphs Carla Oliveira Leonardo de Lima and Vladimir Nikiforov arxiv:14120319v1 [mathsp] 1 Dec 2014 Abstract Let G be graph on n vertices and G (t) its blow-up graph of order t In
More informationTwo Laplacians for the distance matrix of a graph
Two Laplacians for the distance matrix of a graph Mustapha Aouchiche and Pierre Hansen GERAD and HEC Montreal, Canada CanaDAM 2013, Memorial University, June 1013 Aouchiche & Hansen CanaDAM 2013, Memorial
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 informationAn Introduction to Spectral Graph Theory
An Introduction to Spectral Graph Theory Mackenzie Wheeler Supervisor: Dr. Gary MacGillivray University of Victoria WheelerM@uvic.ca Outline Outline 1. How many walks are there from vertices v i to v j
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 informationExtremal Graphs for Randić Energy
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 77 (2017) 77-84 ISSN 0340-6253 Extremal Graphs for Randić Energy Kinkar Ch. Das, Shaowei Sun Department
More informationSpectra of the generalized edge corona of graphs
Discrete Mathematics, Algorithms and Applications Vol 0, No 08) 85000 0 pages) c World Scientific Publishing Company DOI: 04/S7938309850007 Spectra of the generalized edge corona of graphs Yanyan Luo and
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More informationOn the second Laplacian eigenvalues of trees of odd order
Linear Algebra and its Applications 419 2006) 475 485 www.elsevier.com/locate/laa On the second Laplacian eigenvalues of trees of odd order Jia-yu Shao, Li Zhang, Xi-ying Yuan Department of Applied Mathematics,
More informationMaxima of the signless Laplacian spectral radius for planar graphs
Electronic Journal of Linear Algebra Volume 0 Volume 0 (2015) Article 51 2015 Maxima of the signless Laplacian spectral radius for planar graphs Guanglong Yu Yancheng Teachers University, yglong01@16.com
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 informationThe Laplacian spectrum of a mixed graph
Linear Algebra and its Applications 353 (2002) 11 20 www.elsevier.com/locate/laa The Laplacian spectrum of a mixed graph Xiao-Dong Zhang a,, Jiong-Sheng Li b a Department of Mathematics, Shanghai Jiao
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 informationELA A LOWER BOUND FOR THE SECOND LARGEST LAPLACIAN EIGENVALUE OF WEIGHTED GRAPHS
A LOWER BOUND FOR THE SECOND LARGEST LAPLACIAN EIGENVALUE OF WEIGHTED GRAPHS ABRAHAM BERMAN AND MIRIAM FARBER Abstract. Let G be a weighted graph on n vertices. Let λ n 1 (G) be the second largest eigenvalue
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 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 informationOn the distance and distance signless Laplacian eigenvalues of graphs and the smallest Gersgorin disc
Electronic Journal of Linear Algebra Volume 34 Volume 34 (018) Article 14 018 On the distance and distance signless Laplacian eigenvalues of graphs and the smallest Gersgorin disc Fouzul Atik Indian Institute
More informationEnergy, Laplacian Energy and Zagreb Index of Line Graph, Middle Graph and Total Graph
Int. J. Contemp. Math. Sciences, Vol. 5, 21, no. 18, 895-9 Energy, Laplacian Energy and Zagreb Index of Line Graph, Middle Graph and Total Graph Zhongzhu Liu Department of Mathematics, South China Normal
More informationLaplacians of Graphs, Spectra and Laplacian polynomials
Laplacians of Graphs, Spectra and Laplacian polynomials Lector: Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk State University Winter School in Harmonic Functions on Graphs and Combinatorial
More informationOn graphs with largest Laplacian eigenvalue at most 4
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 44 (2009), Pages 163 170 On graphs with largest Laplacian eigenvalue at most 4 G. R. Omidi Department of Mathematical Sciences Isfahan University of Technology
More informationPreliminaries and Complexity Theory
Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra
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 informationEigenvalues and edge-connectivity of regular graphs
Eigenvalues and edge-connectivity of regular graphs Sebastian M. Cioabă University of Delaware Department of Mathematical Sciences Newark DE 19716, USA cioaba@math.udel.edu August 3, 009 Abstract In this
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 informationThe Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph
The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph arxiv:1304.1315v6 [math.sp] 11 May 2013 Shenglong Hu, Liqun Qi, Jinshan Xie May 14, 2013 Abstract In this paper, we show
More informationBasic graph theory 18.S995 - L26.
Basic graph theory 18.S995 - L26 dunkel@math.mit.edu http://java.dzone.com/articles/algorithm-week-graphs-and no cycles Isomorphic graphs f(a) = 1 f(b) = 6 f(c) = 8 f(d) = 3 f(g) = 5 f(h) = 2 f(i) = 4
More informationProgram (Day 1) Spectral mapping theorem and asymptotic behavior of quantum walks on infinite graphs
Program (Day 1) Nov.29 (Fri) Kawai Hall, Dept. of Math., Tohoku Univ. 9:25 9:30 10:10 10:20 11:00 11:10 11:50 14:00 14:40 14:50 15:30 15:40 16:30 18:00 Opening Address from Chair Spectral mapping theorem
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 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 informationThe eigenvalues of an n x n complex matrix A are the roots of the n th degree polynomial det(a-λi) = 0. Further the positive square roots of the
The eigenvalues of an n x n complex matrix A are the roots of the n th degree polynomial det(a-λi) = 0. Further the positive square roots of the eigenvalues of the positive semidefinite matrix A*A are
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 informationCopies of a rooted weighted graph attached to an arbitrary weighted graph and applications
Electronic Journal of Linear Algebra Volume 26 Volume 26 2013 Article 47 2013 Copies of a rooted weighted graph attached to an arbitrary weighted graph and applications Domingos M. Cardoso dcardoso@ua.pt
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 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 informationInverse Perron values and connectivity of a uniform hypergraph
Inverse Perron values and connectivity of a uniform hypergraph Changjiang Bu College of Automation College of Science Harbin Engineering University Harbin, PR China buchangjiang@hrbeu.edu.cn Jiang Zhou
More informationSpectra of Adjacency and Laplacian Matrices
Spectra of Adjacency and Laplacian Matrices Definition: University of Alicante (Spain) Matrix Computing (subject 3168 Degree in Maths) 30 hours (theory)) + 15 hours (practical assignment) Contents 1. Spectra
More informationNormalized rational semiregular graphs
Electronic Journal of Linear Algebra Volume 8 Volume 8: Special volume for Proceedings of Graph Theory, Matrix Theory and Interactions Conference Article 6 015 Normalized rational semiregular graphs Randall
More informationA Characterization of Distance-Regular Graphs with Diameter Three
Journal of Algebraic Combinatorics 6 (1997), 299 303 c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. A Characterization of Distance-Regular Graphs with Diameter Three EDWIN R. VAN DAM
More informationLaplacians of Graphs, Spectra and Laplacian polynomials
Mednykh A. D. (Sobolev Institute of Math) Laplacian for Graphs 27 June - 03 July 2015 1 / 30 Laplacians of Graphs, Spectra and Laplacian polynomials Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk
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 informationOn the Average of the Eccentricities of a Graph
Filomat 32:4 (2018), 1395 1401 https://doi.org/10.2298/fil1804395d Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On the Average
More informationOn marker set distance Laplacian eigenvalues in graphs.
Malaya Journal of Matematik, Vol 6, No 2, 369-374, 2018 https://doiorg/1026637/mjm0602/0011 On marker set distance Laplacian eigenvalues in graphs Medha Itagi Huilgol1 * and S Anuradha2 Abstract In our
More informationExtremal graphs for the sum of the two largest signless Laplacian eigenvalues
Electronic Journal of Linear Algebra Volume 30 Volume 30 (2015) Article 41 2015 Extremal graphs for the sum of the two largest signless Laplacian eigenvalues Carla Silva Oliveira Escola Nacional de Ciencias
More informationSpectral directed hypergraph theory via tensors
Linear and Multilinear Algebra ISSN: 0308-1087 (Print) 1563-5139 (Online) Journal homepage: http://www.tandfonline.com/loi/glma20 Spectral directed hypergraph theory via tensors Jinshan Xie & Liqun Qi
More informationNote on the normalized Laplacian eigenvalues of signed graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 44 (2009), Pages 153 162 Note on the normalized Laplacian eigenvalues of signed graphs Hong-hai Li College of Mathematic and Information Science Jiangxi Normal
More informationApplications of Eigenvalues in Extremal Graph Theory
Applications of Eigenvalues in Extremal Graph Theory Olivia Simpson March 14, 201 Abstract In a 2007 paper, Vladimir Nikiforov extends the results of an earlier spectral condition on triangles in graphs.
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 informationSpectral Graph Theory and You: Matrix Tree Theorem and Centrality Metrics
Spectral Graph Theory and You: and Centrality Metrics Jonathan Gootenberg March 11, 2013 1 / 19 Outline of Topics 1 Motivation Basics of Spectral Graph Theory Understanding the characteristic polynomial
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 435 (2011) 1029 1033 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Subgraphs and the Laplacian
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
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 informationLaplacian for Graphs Exercises 1.
Laplacian for Graphs Exercises 1. Instructor: Mednykh I. A. Sobolev Institute of Mathematics Novosibirsk State University Winter School in Harmonic Functions on Graphs and Combinatorial Designs 20-24 January,
More informationRegular factors of regular graphs from eigenvalues
Regular factors of regular graphs from eigenvalues Hongliang Lu Center for Combinatorics, LPMC Nankai University, Tianjin, China Abstract Let m and r be two integers. Let G be a connected r-regular graph
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 informationMaximizing the numerical radii of matrices by permuting their entries
Maximizing the numerical radii of matrices by permuting their entries Wai-Shun Cheung and Chi-Kwong Li Dedicated to Professor Pei Yuan Wu. Abstract Let A be an n n complex matrix such that every row and
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 informationLinear Algebra and its Applications
Linear Algebra and its Applications 430 (2009) 532 543 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Computing tight upper bounds
More informationInequalities for the spectra of symmetric doubly stochastic matrices
Linear Algebra and its Applications 49 (2006) 643 647 wwwelseviercom/locate/laa Inequalities for the spectra of symmetric doubly stochastic matrices Rajesh Pereira a,, Mohammad Ali Vali b a Department
More informationCLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES
Bull Korean Math Soc 45 (2008), No 1, pp 95 99 CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES In-Jae Kim and Bryan L Shader Reprinted
More informationSHARP BOUNDS FOR THE GENERAL RANDIĆ INDEX R 1 OF A GRAPH
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 47, Number, 207 SHARP BOUNDS FOR THE GENERAL RANDIĆ INDEX R OF A GRAPH EI MILOVANOVIĆ, PM BEKAKOS, MP BEKAKOS AND IŽ MILOVANOVIĆ ABSTRACT Let G be an undirected
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 informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
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 informationSIMPLICES AND SPECTRA OF GRAPHS
University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 9, 000 Ljubljana, Slovenia Preprint series, Vol. 47 (2009), 07 SIMPLICES AND SPECTRA OF GRAPHS
More informationOn the Normalized Laplacian Energy(Randić Energy)
On the Normalized Laplacian Energy(Randić Energy) Selçuk University, Konya/Turkey aysedilekmaden@selcuk.edu.tr SGA 2016- Spectral Graph Theory and Applications May 18-20, 2016 Belgrade, SERBIA Outline
More informationNew feasibility conditions for directed strongly regular graphs
New feasibility conditions for directed strongly regular graphs Sylvia A. Hobart Jason Williford Department of Mathematics University of Wyoming Laramie, Wyoming, U.S.A sahobart@uwyo.edu, jwillif1@uwyo.edu
More informationRegular graphs with a small number of distinct eigenvalues
Regular graphs with a small number of distinct eigenvalues Tamara Koledin UNIVERZITET U BEOGRADU ELEKTROTEHNIČKI FAKULTET This is joint work with Zoran Stanić Bipartite regular graphs Bipartite regular
More informationNORDHAUS-GADDUM RESULTS FOR WEAKLY CONVEX DOMINATION NUMBER OF A GRAPH
Discussiones Mathematicae Graph Theory 30 (2010 ) 257 263 NORDHAUS-GADDUM RESULTS FOR WEAKLY CONVEX DOMINATION NUMBER OF A GRAPH Magdalena Lemańska Department of Applied Physics and Mathematics Gdańsk
More informationThe spectral radius of graphs on surfaces
The spectral radius of graphs on surfaces M. N. Ellingham* Department of Mathematics, 1326 Stevenson Center Vanderbilt University, Nashville, TN 37240, U.S.A. mne@math.vanderbilt.edu Xiaoya Zha* Department
More informationOn the inverse matrix of the Laplacian and all ones matrix
On the inverse matrix of the Laplacian and all ones matrix Sho Suda (Joint work with Michio Seto and Tetsuji Taniguchi) International Christian University JSPS Research Fellow PD November 21, 2012 Sho
More informationOn Brooks Coloring Theorem
On Brooks Coloring Theorem Hong-Jian Lai, Xiangwen Li, Gexin Yu Department of Mathematics West Virginia University Morgantown, WV, 26505 Abstract Let G be a connected finite simple graph. δ(g), (G) and
More informationThe Eigenvectors of the Zero Laplacian and Signless Laplacian Eigenvalues of a Uniform Hypergraph
The Eigenvectors of the Zero Laplacian and Signless Laplacian Eigenvalues of a Uniform Hypergraph arxiv:1303.4048v3 [math.sp] 24 Mar 2013 Shenglong Hu, Liqun Qi April 1, 2015 Abstract In this paper, we
More informationSpectral characterization of Signed Graphs
University of Primorska, Koper May 2015 Signed Graphs Basic notions on Signed Graphs Matrices of Signed Graphs A signed graph Γ is an ordered pair (G, σ), where G = (V (G), E(G)) is a graph and σ : E(G)
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 19
832: Algebraic Combinatorics Lionel Levine Lecture date: April 2, 20 Lecture 9 Notes by: David Witmer Matrix-Tree Theorem Undirected Graphs Let G = (V, E) be a connected, undirected graph with n vertices,
More informationAlgebraic aspects of the normalized Laplacian
Algebraic aspects of the normalized Laplacian Steve Butler Abstract Spectral graph theory looks at the interplay between the structure of a graph and the eigenvalues of a matrix associated with the graph.
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 information1 Matrix notation and preliminaries from spectral graph theory
Graph clustering (or community detection or graph partitioning) is one of the most studied problems in network analysis. One reason for this is that there are a variety of ways to define a cluster or community.
More informationThe (signless) Laplacian spectral radii of c-cyclic graphs with n vertices, girth g and k pendant vertices
Linear and Multilinear Algebra ISSN: 0308-1087 Print 1563-5139 Online Journal homepage: http://www.tandfonline.com/loi/glma0 The signless Laplacian spectral radii of c-cyclic graphs with n vertices, girth
More informationLecture 1: Graphs, Adjacency Matrices, Graph Laplacian
Lecture 1: Graphs, Adjacency Matrices, Graph Laplacian Radu Balan January 31, 2017 G = (V, E) An undirected graph G is given by two pieces of information: a set of vertices V and a set of edges E, G =
More informationIowa State University and American Institute of Mathematics
Matrix and Matrix and Iowa State University and American Institute of Mathematics ICART 2008 May 28, 2008 Inverse Eigenvalue Problem for a Graph () Problem for a Graph of minimum rank Specific matrices
More informationChapter 2 Spectra of Finite Graphs
Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n
More informationarxiv: v1 [math.co] 23 Feb 2014
Spectral Radius of Bipartite Graphs Chia-an Liu a,, Chih-wen Weng b a Department of Applied Mathematics, National Chiao-Tung University, Hsinchu, Taiwan b Department of Applied Mathematics, National Chiao-Tung
More informationLAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS
Kragujevac Journal of Mathematics Volume 39() (015), Pages 193 05. LAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS HARISHCHANDRA S. RAMANE 1, GOURAMMA A. GUDODAGI 1,
More informationApplying block intersection polynomials to study graphs and designs
Applying block intersection polynomials to study graphs and designs Leonard Soicher Queen Mary University of London CoCoA15, Colorado State University, Fort Collins, July 2015 Leonard Soicher (QMUL) Block
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More information