Spectral radii of graphs with given chromatic number
|
|
- Brandon Harrell
- 5 years ago
- Views:
Transcription
1 Applied Mathematics Letters 0 ( wwwelseviercom/locate/aml Spectral radii of graphs with given chromatic number Lihua Feng, Qiao Li, Xiao-Dong Zhang Department of Mathematics, Shanghai Jiao Tong University, 800 Dongchuan Road, Shanghai 0040, PR China Received 30 September 005; accepted 18 November 005 Abstract We consider the set G n, of graphs of order n with the chromatic number In this note, we prove that in G n, the Turán graph T n, has the maximal spectral radius; and P n if =, C n if = 3andn is odd, Cn 1 1 (l if = 3andn is even, K if 4 has the minimal spectral radius Thus we answer a problem raised by Cao [DS Cao, Index function of graphs, J East China Norm Univ Sci Ed 4 ( (in Chinese MR89m:05084] and Hong [Y Hong, Bounds of eigenvalues of graphs, Discrete Math 13 ( ] in the affirmative c 006 Elsevier Ltd All rights reserved Keywords: Chromatic number; Spectral radius 1 Introduction In this note, we consider undirected simple connected graphs Let G be a graph with vertex set V (G and edge set E(G The eigenvalues of G are the eigenvaluesof its adjacency matrix A(G The largest eigenvalue of A(G is called the spectral radius of G, denoted by ρ(g In general, the spectral radius ρ(a of a nonnegative matrix A is the largest norm of its eigenvalues We refer the reader to [3] for more details in spectral graph theory The chromatic number χ(g of a graph G is the minimum number of colors such that G can be colored in a way such that no two adjacent vertices have the same color The classical result of Broos []saidthatχ(g Δ(G + 1 with equality if and only if G is an odd cycle or a complete graph Wilf [11] andcao[5] further improved this result by using the spectral radius of a graph Let G n, be the set of connected graphs of order n with chromatic number We define the following two functions on the spectral radius: r(g n, = min{ρ(g G G n, }, R(G n, = max{ρ(g G G n, } A natural question to as is: for the given set G n,, how do we describe the graphs that attain the above two numbers? Supported by the National Natural Science Foundation of China (No and the project sponsored by SRF for ROCS, SEM Corresponding author addresses: lihuafeng@sjtueducn (L Feng, qiaoli@sjtueducn (Q Li, xiaodong@sjtueducn (X-D Zhang /$ - see front matter c 006 Elsevier Ltd All rights reserved doi:101016/jaml
2 L Feng et al / Applied Mathematics Letters 0 ( First, Cao [6] gave some partial results on r(g n, and conjectured that r(g n, = ρ(k (l if the chromatic number is large enough and +l = n, where K (l is obtained by joining a path of order l to the complete graph K Further, Hong ([8] problem posed the following problem: Let G be a connected graph with n vertices and chromatic number ; we already now that 1 ρ(g n( 1 What is the best possible lower bound? In this note, we investigate the above two problems In Section, we prove that R(G n, = ρ(t n,,wheret n, is the Turán graph with parts whose partition sets differ in size by at most one We also determine r(g n, completely in Section 3 To determine R(G n, Let G be a graph of order n with χ(g = From the definition, G has color classes and each is an independent set Suppose the classes have orders n 1 n n Since the addition of edges will increase the spectral radius, the graphs which achieve R(G n, must be complete -partite graphs Next we prove that of all the complete -partite graphs, the Turán graph T n, has maximal spectral radius Theorem 1 Let G be a complete -partite graph of order n The numbers of the vertices of the parts are ordered as n 1 n n Thenρ(G ρ(t n, with equality if and only if G = T n, Proof The characteristic polynomial of G (see [3, p 74] is λ (1 n n i (λ + n i λ + n i=1 i i=1 Obviously, its largest root is the unique positive solution of 1 i=1 n i λ + n i = 0 We claim that if n 1 n, then ρ(g <ρ(t n, Consider the following equation: f (δ, λ = 1 n 1 1 δ λ + n 1 δ i= n i λ + n i n + δ λ + n + δ, where 0 δ n 1 n is an integer So f (0,ρ(G = 0 Taingthe derivativewith respecttoδ, wehave, forλ>0, d f (δ, λ dδ = λ (λ + n 1 δ λ (λ + n + δ < 0 Hence f (δ, λ is decreasing with respect to δ for λ>0 Thus f (1,ρ(G < 0 This means that if we increase n by one and decrease n 1 by one in G, the spectral radius will increase So we complete the proof Hence, we may present the main result in this section Theorem T n, is the only graph that attains R(G n, Corollary 3 Let T n, be a Turán graph with α(0 α< parts of size d + 1 and α parts of size d, Then ρ(t n, = 1 ( n d 1 + (n + 1 4α(d + 1 n d with the last equality if and only if T n, is regular Proof From Eq (* in Theorem 1, ρ(t n, satisfies α(d + 1 d( α + = 1 λ + d + 1 λ + d Note that n = d + α, wehave λ (n d 1λ (n d α(d + 1 = 0, (*
3 160 L Feng et al / Applied Mathematics Letters 0 ( Fig 1 The tree W n (n 7 which implies the result The last equality holds if and only if α = 0sinceρ(T n, is a strictly decreasing function with respect to α By Theorem 1 and Corollary 3, we get the main result in [7], and the equality case is given as well Corollary 4 Let G be a connected graph of order n and chromatic number Then ρ(g n(1 1 with equality if and only if G is a regular Turán graph 3 To determine r(g n, We consider the graph G uv obtained from the connected graph G by subdividing the edge uv, that is, by replacing uv with edges uw, vw where w is an additional vertex We call the following two types of paths internal paths: (a a sequence of vertices v 0,v 1,,v +1 ( where v 0,v 1,,v are distinct, v +1 = v 0 of degree at least 3, d vi = fori = 1,,, andv i 1 and v i (i = 1,, + 1 are adjacent (b A sequence of distinct vertices v 0,v 1,,v +1 ( 0 such that v i 1 and v i (i = 1,, + 1 are adjacent, d v0 3, d v+1 3andd vi = whenever 1 i Lemma 31 ([4] If uv lies on an internal path of the connected graph G and G W n (see Fig 1, then ρ(g uv <ρ(g Lemma 3 ([10] Suppose G is a nontrivial simple connected graph Let u,vbe two vertices at distance not greater than one, ie, u,v are adjacent or identical For nonnegative integers, l, let G(, l denote the graph obtained from G by adding pendant paths of length and l at u,v, respectively If l 1,then ρ(g(, l > ρ(g( + 1, l 1 AgraphG is said to be -critical if χ(g = and χ(g u = 1foreveryu V (G It is well nown that (see [1] every -chromatic graph contains a -critical subgraph Lemma 33 ([9] Suppose χ(g = 4 Let G be a -critical graph on more than vertices (so G = K Then ( 1 3 E(G + ( V (G 1 Lemma 34 ([6] The spectral radius of K (l, 4, satisfies ( 1 ρ(k (l <1 3 + ( Proof We present a proof here for completeness Since K (l contains K as a subgraph, the left hand side of the above inequality is obvious In the following, we denote the characteristic polynomial of P l, the path on l vertices, by f l (λ Then P(K (l,λ = (λ + 1(λ f l (λ (λ + (λ + 1 f l 1 (λ = (λ + 1 [(λ + 1(λ + 1 f l (λ (λ + f l 1 (λ] = (λ + 1 [λ(λ + f l (λ ( 1 f l (λ (λ + f l 1 (λ] = (λ + 1 [(λ + (λf l (λ f l 1 (λ ( 1 f l (λ] = (λ + 1 [(λ + f l+1 (λ ( 1 f l (λ]
4 L Feng et al / Applied Mathematics Letters 0 ( Since f l+1 (λ = λf l (λ f l 1 (λ, by the induction hypothesis, the sequence f l+1(λ f l (λ f l+1 (λ f l (λ Hence > λ + λ 4 is strictly decreasing and P(K (l,λ >(λ+ 1 f l (λg(λ, where g(λ = (λ + λ+ λ Obviously, g(λ is an increasing function with respect to λ Solving the equation g(λ = 0, we have that its largest root is λ 0 = 1 ( 3 + If λ>λ 0, P(K (l ( > 3 (l,λ >0andρ(K <λ 0 We complete the proof We now can present the main result in this section Theorem 35 (1 If =,thenp n is the only graph in G n, that attains r(g n, (1 If = 3 and n is odd, then C n is the only graph in G n, that attains r(g n, ( If = 3 and n is even, then Cn 1 1 is the only graph in G n, that attains r(g n,,wherecn 1 1 is obtained from the cycle C n 1 by adding one pendent vertex (3 If 4,thenK (l is the only graph in G n, that attains r(g n, Proof Let G be a connected graph of order n with chromatic number (1 It is easy to see that (1 holds (for example, [3, p 78] ( If = 3, then G must contain an odd cycle C h as a 3-critical subgraph for odd integer h ByLemma 31, we have ρ(c 1 3 >ρ(c1 4 > >ρ(c1 n 1 If n is odd and h = n, the result holds If n is odd and h < n,theng contains Ch 1 as a subgraph since G is connected So we have ρ(g ρ(c 1 h ρ(c1 n 1 >ρ(c1 n >ρ(c n If n is even and h < n, by a similar argument, we have ρ(g ρ(c 1 h ρ(c1 n 1 (3 If 4, we discuss the following two cases (a If G does not contain K as a subgraph, we assume that G contains a -critical subgraph H ;thenρ(g ρ(h Since ρ(h E(H V (H, and in view of Lemma 33,wehave ρ(g ρ(h 1 + It is easy to see that > ( 3 + ( Hence Lemma 34 implies ρ(g >ρ(k (l (b If G contains K as a subgraph, then by repeated use of Lemma 3, we can get the result directly Combining the above two cases, we complete the proof of (3
5 16 L Feng et al / Applied Mathematics Letters 0 ( Acnowledgments The authors are grateful to the referees for their valuable comments, corrections and suggestions which led to improvement of this note References [1] B Bollobás, Extremal Graph Theory, Academic Press, London, 1978 (Chapter 5 [] RL Broos, On coloring the node of a networ, Proc Camb Phil Soc 37 ( [3] D Cvetović, M Doob, H Sachs, Spectra of Graphs, Academic Press, New Yor, 1980 [4] D Cvetović, P Rowlinson, SK Simic, Eigenspaces of Graphs, Cambridge University Press, 1997 [5] DS Cao, Bounds on eigenvalues and chromatic number, Linear Algebra Appl 70 ( [6] DS Cao, Index function of graphs, J East China Norm Univ Sci Ed 4 ( (in Chinese MR89m:05084 [7] C Edwards, C Elphic, Lower bounds for the clique and the chromatic number of graph, Discrete Appl Math 5 ( [8] Y Hong, Bounds of eigenvalues of graphs, Discrete Math 13 ( [9] M Krivelevich, An improved upper bound on the minimal number of edges in color-critical graphs, Electr J Combin 1 (1998 R4 [10] Q Li, KQ Feng, On the largest eigenvalues of graphs, Acta Math Appl Sin ( (in Chinese MR80:05079 [11] HS Wilf, The eigenvalues of a graph and its chromatic number, J London Math Soc 4 (
On 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 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 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 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 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 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 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 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 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 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 informationUnicyclic graphs with exactly two main eigenvalues
Applied Mathematics Letters 19 (006) 1143 1147 www.elsevier.com/locate/aml Unicyclic graphs with exactly two main eigenvalues Yaoping Hou a,,fengtian b a Department of Mathematics, Hunan Normal University
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 informationGroup Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
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 informationSharp Bounds for the Signless Laplacian Spectral Radius in Terms of Clique Number
Sharp Bounds for the Signless Laplacian Spectral Radius in Terms of Clique Number Bian He, Ya-Lei Jin and Xiao-Dong Zhang arxiv:109.314v1 [math.co] 14 Sep 01 Department of Mathematics Shanghai Jiao Tong
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 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 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 informationBOUNDS ON THE FIBONACCI NUMBER OF A MAXIMAL OUTERPLANAR GRAPH
BOUNDS ON THE FIBONACCI NUMBER OF A MAXIMAL OUTERPLANAR GRAPH Ahmad Fawzi Alameddine Dept. of Math. Sci., King Fahd University of Petroleum and Minerals, Dhahran 11, Saudi Arabia (Submitted August 1) 1.
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 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 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 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 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 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 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 Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
More informationOn a list-coloring problem
On a list-coloring problem Sylvain Gravier Frédéric Maffray Bojan Mohar December 24, 2002 Abstract We study the function f(g) defined for a graph G as the smallest integer k such that the join of G with
More informationUniquely 2-list colorable graphs
Discrete Applied Mathematics 119 (2002) 217 225 Uniquely 2-list colorable graphs Y.G. Ganjali a;b, M. Ghebleh a;b, H. Hajiabolhassan a;b;, M. Mirzazadeh a;b, B.S. Sadjad a;b a Institute for Studies in
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 informationEvery line graph of a 4-edge-connected graph is Z 3 -connected
European Journal of Combinatorics 0 (2009) 595 601 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Every line graph of a 4-edge-connected
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 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 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 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 informationThe L(2, 1)-labeling on the skew and converse skew products of graphs
Applied Mathematics Letters 20 (2007) 59 64 www.elsevier.com/locate/aml The L(2, 1)-labeling on the skew and converse skew products of graphs Zhendong Shao a,,rogerk.yeh b, David Zhang c a Department of
More informationSpectral densest subgraph and independence number of a graph 1
Spectral densest subgraph and independence number of a graph 1 Reid Andersen (Microsoft Research, One Microsoft Way,Redmond, WA 98052 E-mail: reidan@microsoft.com) Sebastian M. Cioabă 2 (Department of
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 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 informationLinear Algebra and its Applications
Linear Algebra and its Applications 432 2010 661 669 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa On the characteristic and
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 informationAll Ramsey numbers for brooms in graphs
All Ramsey numbers for brooms in graphs Pei Yu Department of Mathematics Tongji University Shanghai, China yupeizjy@16.com Yusheng Li Department of Mathematics Tongji University Shanghai, China li yusheng@tongji.edu.cn
More informationGraphs with given diameter maximizing the spectral radius van Dam, Edwin
Tilburg University Graphs with given diameter maximizing the spectral radius van Dam, Edwin Published in: Linear Algebra and its Applications Publication date: 2007 Link to publication Citation for published
More informationLes Cahiers du GERAD ISSN:
Les Cahiers du GERAD ISSN: 0711 2440 The Minimum Spectral Radius of Graphs with a Given Clique Number D. Stevanović P. Hansen G 2007 44 July 2007 Les textes publiés dans la série des rapports de recherche
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 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 informationSmall Cycle Cover of 2-Connected Cubic Graphs
. Small Cycle Cover of 2-Connected Cubic Graphs Hong-Jian Lai and Xiangwen Li 1 Department of Mathematics West Virginia University, Morgantown WV 26505 Abstract Every 2-connected simple cubic graph of
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 Restricted Edge-Connectivity of Kautz Undirected Graphs
The Restricted Edge-Connectivity of Kautz Undirected Graphs Ying-Mei Fan College of Mathematics and Information Science Guangxi University, Nanning, Guangxi, 530004, China Jun-Ming Xu Min Lü Department
More informationOn judicious bipartitions of graphs
On judicious bipartitions of graphs Jie Ma Xingxing Yu Abstract For a positive integer m, let fm be the maximum value t such that any graph with m edges has a bipartite subgraph of size at least t, and
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 informationIn this paper, we will investigate oriented bicyclic graphs whose skew-spectral radius does not exceed 2.
3rd International Conference on Multimedia Technology ICMT 2013) Oriented bicyclic graphs whose skew spectral radius does not exceed 2 Jia-Hui Ji Guang-Hui Xu Abstract Let S(Gσ ) be the skew-adjacency
More informationConditional colorings of graphs
Discrete Mathematics 306 (2006) 1997 2004 Note Conditional colorings of graphs www.elsevier.com/locate/disc Hong-Jian Lai a,d, Jianliang Lin b, Bruce Montgomery a, Taozhi Shui b, Suohai Fan c a Department
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 informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More informationColoring. Basics. A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]).
Coloring Basics A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]). For an i S, the set f 1 (i) is called a color class. A k-coloring is called proper if adjacent
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 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 informationAverage distance, radius and remoteness of a graph
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-397 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (0) 5 Average distance, radius and remoteness of a graph Baoyindureng
More informationOn uniquely 3-colorable plane graphs without prescribed adjacent faces 1
arxiv:509.005v [math.co] 0 Sep 05 On uniquely -colorable plane graphs without prescribed adjacent faces Ze-peng LI School of Electronics Engineering and Computer Science Key Laboratory of High Confidence
More informationEquitable list colorings of planar graphs without short cycles
Theoretical Computer Science 407 (008) 1 8 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Equitable list colorings of planar graphs
More informationComplexity of conditional colorability of graphs
Complexity of conditional colorability of graphs Xueliang Li 1, Xiangmei Yao 1, Wenli Zhou 1 and Hajo Broersma 2 1 Center for Combinatorics and LPMC-TJKLC, Nankai University Tianjin 300071, P.R. China.
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 informationKernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman
Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu
More informationIntroduction to Domination Polynomial of a Graph
Introduction to Domination Polynomial of a Graph arxiv:0905.2251v1 [math.co] 14 May 2009 Saeid Alikhani a,b,1 and Yee-hock Peng b,c a Department of Mathematics Yazd University 89195-741, Yazd, Iran b Institute
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 informationCutwidth and degeneracy of graphs
Cutwidth and degeneracy of graphs Benoit Kloeckner To cite this version: Benoit Kloeckner. Cutwidth and degeneracy of graphs. IF_PREPUB. 2009. HAL Id: hal-00408210 https://hal.archives-ouvertes.fr/hal-00408210v1
More informationand critical partial Latin squares.
Nowhere-zero 4-flows, simultaneous edge-colorings, and critical partial Latin squares Rong Luo Department of Mathematical Sciences Middle Tennessee State University Murfreesboro, TN 37132, U.S.A luor@math.wvu.edu
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
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 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 informationELA
UNICYCLIC GRAPHS WITH THE STRONG RECIPROCAL EIGENVALUE PROPERTY S. BARIK, M. NATH, S. PATI, AND B. K. SARMA Abstract. AgraphG is bipartite if and only if the negative of each eigenvalue of G is also an
More informationarxiv: v2 [math.co] 19 Jun 2018
arxiv:1705.06268v2 [math.co] 19 Jun 2018 On the Nonexistence of Some Generalized Folkman Numbers Xiaodong Xu Guangxi Academy of Sciences Nanning 530007, P.R. China xxdmaths@sina.com Meilian Liang School
More informationNon-separating 2-factors of an even-regular graph
Discrete Mathematics 308 008) 5538 5547 www.elsevier.com/locate/disc Non-separating -factors of an even-regular graph Yusuke Higuchi a Yui Nomura b a Mathematics Laboratories College of Arts and Sciences
More informationR(p, k) = the near regular complete k-partite graph of order p. Let p = sk+r, where s and r are positive integers such that 0 r < k.
MATH3301 EXTREMAL GRAPH THEORY Definition: A near regular complete multipartite graph is a complete multipartite graph with orders of its partite sets differing by at most 1. R(p, k) = the near regular
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
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 informationDestroying non-complete regular components in graph partitions
Destroying non-complete regular components in graph partitions Landon Rabern landon.rabern@gmail.com June 27, 2011 Abstract We prove that if G is a graph and r 1,..., r k Z 0 such that k i=1 r i (G) +
More informationDiscrete Mathematics. The edge spectrum of the saturation number for small paths
Discrete Mathematics 31 (01) 68 689 Contents lists available at SciVerse ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The edge spectrum of the saturation number for
More informationMultipartite tournaments with small number of cycles
Multipartite tournaments with small number of cycles Gregory Gutin and Arash Rafiey Department of Computer Science Royal Holloway, University of London Egham, Surrey, TW20 0EX, UK Gutin(Arash)@cs.rhul.ac.uk
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
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 informationarxiv:math/ v1 [math.co] 17 Apr 2002
arxiv:math/0204222v1 [math.co] 17 Apr 2002 On Arithmetic Progressions of Cycle Lengths in Graphs Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences
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 informationGraphs with Large Variance
Graphs with Large Variance Yair Caro Raphael Yuster Abstract For a graph G, let V ar(g) denote the variance of the degree sequence of G, let sq(g) denote the sum of the squares of the degrees of G, and
More informationEight theorems in extremal spectral graph theory
Eight theorems in extremal spectral graph theory Michael Tait Carnegie Mellon University mtait@cmu.edu ICOMAS 2018 May 11, 2018 Michael Tait (CMU) May 11, 2018 1 / 1 Questions in extremal graph theory
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 informationGraphs and Combinatorics
Graphs and Combinatorics (2005) 21:469 474 Digital Object Identifier (DOI) 10.1007/s00373-005-0625-0 Graphs and Combinatorics Springer-Verlag 2005 On Group Chromatic Number of Graphs Hong-Jian Lai 1 and
More informationMax k-cut and the smallest eigenvalue
Max -cut and the smallest eigenvalue V. Niiforov arxiv:1604.0088v [math.co] 11 Apr 016 Abstract Let G be a graph of order n and size m, and let mc (G) be the maximum size of a -cut of G. It is shown that
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 informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationA note on balanced bipartitions
A note on balanced bipartitions Baogang Xu a,, Juan Yan a,b a School of Mathematics and Computer Science Nanjing Normal University, 1 Ninghai Road, Nanjing, 10097, China b College of Mathematics and System
More informationGraphs with prescribed star complement for the. eigenvalue.
Graphs with prescribed star complement for the eigenvalue 1 F. Ramezani b,a B. Tayfeh-Rezaie a,1 a School of Mathematics, IPM (Institute for studies in theoretical Physics and Mathematics), P.O. Box 19395-5746,
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 informationBetter bounds for k-partitions of graphs
Better bounds for -partitions of graphs Baogang Xu School of Mathematics, Nanjing Normal University 1 Wenyuan Road, Yadong New District, Nanjing, 1006, China Email: baogxu@njnu.edu.cn Xingxing Yu School
More informationMaximal Independent Sets In Graphs With At Most r Cycles
Maximal Independent Sets In Graphs With At Most r Cycles Goh Chee Ying Department of Mathematics National University of Singapore Singapore goh chee ying@moe.edu.sg Koh Khee Meng Department of Mathematics
More informationThe spectra of super line multigraphs
The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology
More informationON GLOBAL DOMINATING-χ-COLORING OF GRAPHS
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
More informationEvery 3-connected, essentially 11-connected line graph is hamiltonian
Every 3-connected, essentially 11-connected line graph is hamiltonian Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou October 2, 25 Abstract Thomassen conjectured that every 4-connected line graph is hamiltonian.
More information