Sufficient Conditions for Graphs to Be <span class="nowrap"><svg xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://www.w3.org/2000/svg" style="vertical-align:-0.2723999pt" id="M1" height="12.533pt" version="1.1" viewBox="-0.0657574 -12.2606 8.79534 12.533" width="8.79534pt"><g transform="matrix(.017,0,0,-0.017,0,0)"><path id="g113-108" d="M480 416C480 431 465 448 438 448C388 448 312 383 252 330C217 299 188 273 155 237H153L257 680C262 700 263 712 253 712C240 712 183 684 97 674L92 648L126 647C166 646 172 645 163 606L23 -6L29 -12C51 -5 77 2 107 8C115 62 130 128 142 180C153 193 179 220 204 241C231 170 259 106 288 54C317 0 336 -12 358 -12C381 -12 423 2 477 80L460 100C434 74 408 54 398 54C385 54 374 65 351 107C326 154 282 241 263 299C296 332 351 377 403 377C424 377 436 372 445 368C449 366 456 368 462 375C472 386 480 402 480 416Z"/></g></svg>-</span>Connected, Maximally Connected, and Super-Connected

Hong, Zhen-Mu; Xia, Zheng-Jiang; Chen, Fuyuan; Volkmann, Lutz

doi:https://doi.org/10.1155/2021/5588146

Complexity

On this page

Abstract Introduction Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Research Article | Open Access

Volume 2021 | Article ID 5588146 | https://doi.org/10.1155/2021/5588146

Sufficient Conditions for Graphs to Be -Connected, Maximally Connected, and Super-Connected

Zhen-Mu Hong,¹Zheng-Jiang Xia,¹Fuyuan Chen,²and Lutz Volkmann³

Academic Editor: M. Irfan Uddin

Received07 Jan 2021

Revised24 Jan 2021

Accepted27 Jan 2021

Published22 Feb 2021

Abstract

Let be a connected graph with minimum degree and vertex-connectivity . The graph is -connected if , maximally connected if , and super-connected if every minimum vertex-cut isolates a vertex of minimum degree. In this paper, we present sufficient conditions for a graph with given minimum degree to be -connected, maximally connected, or super-connected in terms of the number of edges, the spectral radius of the graph, and its complement, respectively. Analogous results for triangle-free graphs with given minimum degree to be -connected, maximally connected, or super-connected are also presented.

1. Introduction

Let be a simple connected undirected graph, where is the vertex-set of and is the edge-set of . The order and size of are defined by and , respectively; is the degree of a vertex in , that is, the number of edges incident with in ; is the minimum degree of . For a subset , use to denote the subgraph of induced by . For two subsets and of , let be the set of edges between and . The complement of is denoted by . Let denote the disjoint union of graphs and , and let denote the graph obtained from by joining each vertex of to each vertex of . The graph is called a triangle-free graph if contains no triangle. Denote by the largest eigenvalue or the spectral radius of the adjacency matrix of and it is called the spectral radius of . If is connected, then, by Perron-Frobenius Theorem, is simple and there exists a unique (up to a multiple) corresponding positive eigenvector.

A vertex-cut of a connected graph is a set of vertices whose removal disconnects . The vertex-connectivity or simply the connectivity of a connected graph is the minimum cardinality of a vertex-cut of if is not complete, and if is the complete graph of order . A vertex-cut is a minimum vertex-cut or a -cut of if . Apparently, for any graph . The graph is -connected if , maximally connected if , and super-connected (or super-) if every minimum vertex-cut isolates a vertex of minimum degree. Hence, every super-connected graph is also maximally connected. An edge-cut of a connected graph is a set of edges whose removal disconnects . The edge connectivity of a connected graph is defined as the minimum cardinality of an edge-cut over all edge-cuts of . An edge-cut is a minimum edge-cut if . The inequality is obvious. The graph is maximally edge-connected if , and it is super-edge-connected if every minimum edge-cut consists of edges incident with a vertex of minimum degree. Therefore, every super-edge-connected graph is also maximally edge-connected. For graph-theoretical terminology and notation not defined here, one can refer to [1, 2].

Sufficient conditions for graphs to be maximally (edge-) connected or super-(edge-) connected were given by several authors, depending on the order, the maximum and minimum degree, the diameter, the girth, the degree sequence, the clique number and so on. The paper in [3] by Hellwig and Volkmann gives a survey on this topic. Recently, Volkmann and Hong [4] proved that a connected graph or a connected triangle-free graph is maximally edge-connected or super-edge-connected if the number of edges is large enough, and the results corresponding to triangle-free graphs were generalized to connected graphs with given clique number by Volkmann [5].

On the other hand, the relationship between graph properties and eigenvalues has attracted much attention. Fiedler [6] initiated the research on the relationship between graph connectivity and graph eigenvalues, and Fiedler and Nikiforov [7] initiated the investigation on the spectral conditions for graphs to be Hamiltonian or traceable. Cioabă [8] investigated the relationship between edge-connectivity and adjacency eigenvalues of regular graphs. From then on, the edge-connectivity problem has been intensively studied by many researchers, such as Duan et al. [9], Gu et al. [10], Liu et al. [11], Liu et al. [12], and Suil O [13]. For vertex-connectivity, Li [14] presented sufficient conditions for a graph to be -connected using spectral radius and signless Laplacian spectral radius; Feng et al. [15] demonstrated sufficient conditions based on spectral radius for a graph to be -connected and -edge-connected; Feng et al. [16] obtained a tight sufficient condition for a connected graph with fixed minimum degree to be -connected based on its spectral radius, for sufficiently large order. Vertex-connectivity and the second largest adjacency eigenvalue of regular graphs were studied by Abiad et al. [17], Cioabă and Gu [18], O [19], and Zhang [20]. The relationship between vertex-connectivity and adjacency eigenvalues or Laplacian eigenvalues of graphs has been investigated by Hong et al. [21–23] and Liu et al. [24].

Motivated by the researches mentioned above, this paper presents sufficient conditions for a graph with given minimum degree to be -connected, maximally connected, or super-connected in terms of the number of edges, the spectral radius of the graph, or its complement, respectively. In addition, we also give sufficient conditions for a triangle-free graph with given minimum degree to be -connected, maximally connected, or super-connected in terms of the number of edges or its spectral radius, respectively. The results on -connected graph in this paper improve the result in [16] by Feng et al. to some extent.

The rest of this paper is organized as follows. In Section 2, we present sufficient conditions for a graph with given minimum degree to be -connected in terms of the number of edges, the spectral radius of the graph, and its complement, respectively. In terms of the same parameters as in Section 2, by setting , we get sufficient conditions for a graph with given minimum degree to be maximally connected in Section 3, and we obtain sufficient conditions for a graph with given minimum degree to be super-connected in Section 4. In Section 5, sufficient conditions for a triangle-free graph to be -connected, maximally connected, or super-connected are acquired in terms of the number of edges and the spectral radius of the graph, respectively.

2. -Connected Graphs

Let be a connected graph of order , minimum degree , and vertex-connectivity . If or , then . If , then and . If , then when and are nonadjacent, the other vertices are all common neighbors of and . It is necessary to delete all common neighbors of some pair of vertices to separate the graph, so . Therefore, we only need to consider and in the following.

Theorem 1. Let be a connected graph of order , size , and minimum degree .(a)If then is -connected, unless .(b)If andthenis-connected, unlessis a subgraph of.

Proof. Let . On the contrary, suppose that is not -connected; that is, . Let be an arbitrary minimum vertex-cut, and let (), denote the vertex sets of the components of , where . Each vertex in is adjacent to at most vertices of and vertices of . Thus,and so . Let ; then . Therefore,Since is disconnected, there are no edges between and in and(a)Since we suppose that is not -connected, it suffices to prove . By (4) and , and since , we obtain Substituting (6) into (5), it follows that Combining this with (1), we obtain . Hence, all the inequalities in (6) must be equalities and so , , and . Thus, is obtained from by deleting all the edges of the complete bipartite subgraph of . That is, , , , and .(b)To prove that is a subgraph of , we first show that . Suppose that . Since , , and , we haveSubstituting (8) into (5), it follows thatCombining this with (2), it is easy to get . By the hypothesis, we have . Hence, and all the inequalities in (8) must be equalities. Thus, , , , and is obtained from by deleting all the edges of the complete bipartite subgraph of . That is, . However, , a contradiction. Thus, . Combining this with , we get . Since and for each , we have that each vertex of is adjacent to each vertex of and . Therefore, and is a subgraph of .

Theorem 2. Let be a connected graph of order and minimum degree . Ifthenis-connected, unless, whereis the largest root of the equation

Proof. Let . Assume that (10) holds but . Let be an arbitrary minimum vertex-cut of , and let (), denote the vertex-sets of the components of , where . Each vertex in is adjacent to at most vertices of and vertices of . Thus,and so for each . Let . Then, and . Since there are no edges between and in , is a subgraph of and .
Next, we will showDenote for short, where and . Let be the unique positive unit eigenvector corresponding to . By symmetry, let for any ; for any ; for any . According to and the uniqueness of , we have that is the largest root of the following equations:Thus, is the largest root of the equationThen, we havefor any and . Therefore, for any , which means thatSince is a subgraph of for any ,Hence, from the discussion above, we haveBy (10), the above inequalities must be equalities. Thus, , , , and so . The result follows from (15).

Remark 1. In Corollary 3.5 in [16], the authors showed that if is a connected graph of minimum degree and order , and , then is -connected, unless . Apparently, without restriction on the order of graph, Theorem 2 improves Corollary 3.5 in [16].

Theorem 3. Let be a connected graph of order and minimum degree . If is a subgraph of and , thenunless.

Proof. Denote for short. Let be the unique positive unit eigenvector corresponding to . Recall that Rayleigh’s principle implies thatAssume that is a proper subgraph of . Clearly, we could assume that is obtained by omitting just one edge of . Let be the set of vertices of of degree , respectively, where , , and . Since , must contain all the edges between and . Therefore, , with three possible cases: (a) ; (b) ; and (c) . We shall show that case (c) yields a graph whose spectral radius is not smaller than the spectral radius of the graph in case (b) and that case (b) yields a graph whose spectral radius is not smaller than the spectral radius of the graph in case (a).
Firstly, suppose that case (a) occurs; that is, . Choose a vertex . If , then by removing the edge and adding the edge we obtain a new graph which is covered by case (b). By the Rayleigh principle,If , then by removing all the edges between and and adding all the edges between and we obtain a new graph which is also covered by case (b). By the Rayleigh principle,Secondly, suppose that case (b) occurs; that is, . Choose a vertex and . If , then by removing the edge and adding the edge we obtain a new graph which is covered by case (c). By the Rayleigh principle,If , then by removing all the edges between and and adding all the edges between and we obtain a new graph which is also covered by case (c). By the Rayleigh principle,Therefore, we could assume that . By symmetry, let for any ; for any ; for any ; and . According to and the uniqueness of , we have that is the largest root of following equations:Thus, is the largest root of the equationBy some basic calculations, we haveSet . It is easy to see that the function is strictly increasing when . Since , we getBy and , we have and then, , and . Therefore, it is easy to find that the largest root of is in the interval , which yields .

The following lemma gives a sharp upper bound of the spectral radius of connected graphs with given number of edges and minimum degree.

Lemma 1 (see [25]). Let be a connected graph with vertices and edges. Let be the minimum degree of and let be the spectral radius of the adjacency matrix of . Then,

Equality holds if and only if is either a regular graph or a bidegreed graph in which each vertex is of degree either or .

Theorem 4. Let be a connected graph of order and minimum degree . If andthen is -connected, unless .

Proof. On the contrary, suppose that . Since is connected and , by Lemma 1, we havewhich yieldsSince , we obtain . By Theorem 1 (b), is a subgraph of . Since , by Theorem 3, . The proof is completed.

Remark 2. In Theorem 3.4 in [16], the authors proved that if is a connected graph of minimum degree and order , and , then is -connected unless . Obviously, Theorem 4 improves Theorem 3.4 in [16] from the perspective of the restriction on the order of graph.

Another sufficient condition for graphs to be -connected can be obtained by using the spectral radius of the complement of a graph.

Theorem 5. Let be a connected graph of order and minimum degree . Ifthenis-connected, unless.

Proof. Let . Assume that (35) holds but . Let be an arbitrary minimum vertex-cut of , and let (), denote the vertex-sets of the components of , where . Each vertex in is adjacent to at most vertices of and vertices of . Thus,and so for each . Let . Then, and . Since there are no edges between and in , is a subgraph of . Thus,By (35), the above inequalities must be equalities. Thus, , and , and so .

3. Maximally Connected Graphs

If , then is maximally connected. Therefore, by setting in Theorem 1, we obtain the following theorem.

Theorem 6. Let be a connected graph of order , size , and minimum degree .(a)If, thenis maximally connected, unless.(b)Ifand, thenis maximally connected, unlessis a subgraph of.

Theorem 7. Let be a connected graph of order and minimum degree . Ifthenis maximally connected, unless.

Proof. On the contrary, suppose that . Since is connected, by (38) and Lemma 1, we havewhich yieldsBy Theorem 6 (a), . To complete the proof, we only need to show .
Since , the equalities hold in (39). Thus, by Lemma 1, is either a regular graph or a bidegreed graph in which each vertex is of degree or . However, the vertices of have degrees from the set . Therefore, and the result follows.

By setting in Theorem 2, we obtain the following result.

Theorem 8. Let be a connected graph of order and minimum degree . Ifthenis maximally connected, unless, whereis the largest root of the equation

Theorem 9. Let be a connected graph of order and minimum degree . If andthen is maximally connected, unless .

Proof. Set in the proofs of Theorems 3 and 4. If , then the result follows from Theorem 4. If , then case (a) cannot occur in the proof of Theorems 3. In Theorem 3, by noting that , , , , and , we have and so Theorem 3 holds for . Hence, Theorem 4 also holds for and the result follows.

Remark 3. In the proof of Theorem 3, if we take and , then when . Notice that . So, the largest root of is greater than if , and it follows that . That is to say, the requirement in Theorem 9 is best possible when .

By setting in Theorem 5, we have the following result.

Theorem 10. Let be a connected graph of order and minimum degree . Ifthen is maximally connected, unless .

4. Super-Connected Graphs

For any connected graph of order , if , then is super-. Therefore, is considered in this section.

Theorem 11. Let be a connected graph of order , size , and minimum degree . Ifthenis super-, unless, whereis an edge ofwithand.

Proof. Since , by Theorem 6 (a), . On the contrary, suppose that is not super-. Let be an arbitrary minimum vertex-cut with vertices, and let () denote the vertex-sets of the components of , where . Denote . Since is disconnected, there are no edges between and in , andThus, by and , we haveIf , then all the inequalities in the above proof must be equalities. It is deduced that , , , and for each , for each , and for each . That is, , , , and . However, , which is a contradiction. Therefore, . By (45), .
Next, we show that is a proper subgraph of . It suffices to prove that and .
If , then . Combining (45) with (46), we obtainAll the above inequalities must be equalities, and so , , and . However, , which is a contradiction. Therefore, .
If , then . Let . Then and . Since is disconnected, there are no edges among , , and in (i.e., , , ), andwhich is a contradiction. Therefore, .
Let . Then and . Therefore, . Since and , is an edge of with and .

Theorem 12. Let be a connected graph of order and minimum degree . Ifthen is super-.

Proof. On the contrary, suppose that is not super-. Since is connected, by (50) and Lemma 1, we havewhich yieldsBy Theorem 11, , where is an edge of with and .
Since , the equalities hold in (51). Thus, by Lemma 1, is either a regular graph or a bidegreed graph in which each vertex is of degree or . However, the vertices of have degree from the set . Thus, cannot be a bidegreed graph, which yields a contradiction. Hence, is super-.

Theorem 13. Let be a connected graph of order and minimum degree . Ifthenis super-, whereis the largest root of the equation

Proof. On the contrary, suppose that is not super-. Let be an arbitrary minimum vertex-cut with vertices, and let () denote the vertex-sets of the components of , where . Denote . Then and . Since there are no edges between and in , is a subgraph of and .
According to (15) in the proof of Theorem 2, is the largest root of the equationThen, we havefor any and . Therefore, .
Since is a subgraph of for any , we getHence, from the above discussion, we obtainBy (53), the above inequalities must be equalities. Thus, , , , and . However, , which is a contradiction. The result follows.

Theorem 14. Let be a connected graph of order and minimum degree . Ifthenis super-.

Proof. Assume that (59) holds but is not super-. Let be an arbitrary minimum vertex-cut of with vertices, and let (), denote the vertex-sets of the components of , where . Denote . Then and . Since there are no edges between and in , is a subgraph of . Thus,By (59), the above inequalities must be equalities. Thus, , , and , and so . However, , a contradiction. This completes the proof.

5. Sufficient Conditions for Triangle-Free Graphs

Let us extend an interesting result by applying the famous theorem of Mantel [26] and Turán [27].

Theorem 15 (see [26, 27]). For any triangle-free graph of order , we have , with equality if and only if .

Theorem 16. Let be a connected triangle-free graph of order , size , and minimum degree . Ifthen is -connected, unless and is a minimum vertex-cut of with , , and .

Proof. Let . On the contrary, suppose that . Let be a minimum vertex-cut of , and let () denote the vertex-sets of the components of , where . Set . Then and . By Theorem 15, we deduce thatwith equalities if and only ifIf , then . The assumption implies that has at least one neighbor . Since is triangle-free, we deduce that , where is the neighbor set of . As , it follows thatand thus . Therefore, we arrive atTogether with and (62), it leads toCombining this with (61), we have , and so , , , , , and . Therefore, , , and . This completes the proof.

Theorem 17. Let be a connected triangle-free graph of order and minimum degree . Ifthen is -connected.

Proof. On the contrary, suppose that . Since is connected, by (67) and Lemma 1, we havewhich yieldsBy Theorem 16, and is a minimum vertex-cut of with , , and .
Since , the equalities hold in (68). Thus, by Lemma 1, is either a regular graph or a bidegreed graph in which each vertex is of degree or . However, is neither a regular graph nor the complete bipartite graph , which yields a contradiction. Hence, is -connected.
By setting in Theorems 16 and 17, we obtain the two following theorems.

Theorem 18. Let be a connected triangle-free graph of order , size , and minimum degree . Ifthen is maximally connected, unless , and is a minimum vertex-cut of with , , and .

Theorem 19. Let be a connected triangle-free graph of order and minimum degree . Ifthen is maximally connected.

For super-connected graphs, we have the following results.

Theorem 20. Let be a connected triangle-free graph of order , size , and minimum degree . Ifthenis super-.

Proof. Let . On the contrary, suppose that is not super-. Since , by Theorem 18, . Let be a minimum vertex-cut of with vertices, and let () denote the vertex-sets of the components of , where . Set ; then . Therefore, with the same proceeding of the proof of Theorem 16 (from (62) to (65)), we arrive atTogether with and (62), it leads toCombining this with (72), we have , and so , , , , and . Therefore, , , and . Thus, , which contradicts the fact that is a component of with at least two vertices. The result follows.

Theorem 21. Let be a connected triangle-free graph of order and minimum degree . Ifthenis super-.

Proof. Since is connected, by (75) and Lemma 1, we havewhich yieldsBy Theorem 20, is super-.

Remark 4. The lower bound on given in Theorem 20 is sharp. For example, let , , , , and is a minimum vertex-cut of with , , and . It is easy to check thatHowever, , which yields that is not super-connected.

Data Availability

No data were used to support the findings of the study.

Conflicts of Interest

The authors declare no conflicts of interest.

Acknowledgments

The research of Zhen-Mu Hong is supported by NSFC (no. 11601002), Key Projects in Natural Science Research of Anhui Provincial Department of Education (nos. KJ2020A0015, KJ2018A0438, and KJ2016A003) and Outstanding Young Talents International Visiting Program of Anhui Provincial Department of Education (no. gxgwfx2018031). The research of Fuyuan Chen is supported by NSFC (no. 11601001).

References

J. A. Bondy and U. S. R. Murty, Graph Theory. Graduate Texts in Mathematics, Springer, NY, New York, 2008.
J.-M. Xu, Theory and Application of Graphs, Kluwer Academic Publishers, Boston London, 2003.
A. Hellwig and L. Volkmann, “Maximally edge-connected and vertex-connected graphs and digraphs: a survey,” Discrete Mathematics, vol. 308, no. 15, pp. 3265–3296, 2008.
View at: Publisher Site | Google Scholar
L. Volkmann and Z.-M. Hong, “Sufficient conditions for maxmally edge-connected and super-edge-connected graphs,” Communications in Combinatorics and Optimization, vol. 2, no. 1, pp. 35–41, 2017.
View at: Google Scholar
L. Volkmann, “Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number,” Discussiones Mathematicae Graph Theory, vol. 39, no. 2, pp. 567–573, 2019.
View at: Publisher Site | Google Scholar
M. Fiedler, “Algebraic connectivity of graphs,” Czechoslovak Mathematical Journal, vol. 23, no. 2, pp. 298–305, 1973.
View at: Publisher Site | Google Scholar
M. Fiedler and V. Nikiforov, “Spectral radius and Hamiltonicity of graphs,” Linear Algebra and Its Applications, vol. 432, pp. 2170–2173, 2009.
View at: Google Scholar
S. M. Cioabă, “Eigenvalues and edge-connectivity of regular graphs,” Linear Algebra and Its Applications, vol. 432, pp. 458–470, 2010.
View at: Publisher Site | Google Scholar
C. Duan, L. Wang, and X. Liu, “Edge connectivity, packing spanning trees, and eigenvalues of graphs,” Linear and Multilinear Algebra, vol. 68, no. 6, pp. 1077–1095, 2020.
View at: Publisher Site | Google Scholar
X. Gu, H.-J. Lai, P. Li, and S. Yao, “Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs,” Journal of Graph Theory, vol. 81, no. 1, pp. 16–29, 2016.
View at: Publisher Site | Google Scholar
H. Liu, M. Lu, and F. Tian, “Edge-connectivity and (signless) Laplacian eigenvalue of graphs,” Linear Algebra and Its Applications, vol. 439, no. 12, pp. 3777–3784, 2013.
View at: Publisher Site | Google Scholar
R. Liu, H.-J. Lai, and Y. Tian, “Spanning tree packing number and eigenvalues of graphs with given girth,” Linear Algebra and Its Applications, vol. 578, pp. 411–424, 2019.
View at: Publisher Site | Google Scholar
S. O., “Edge-connectivity in regular multigraphs from eigenvalues,” Linear Algebra and Its Applications, vol. 491, pp. 4–14, 2016.
View at: Google Scholar
R. Li, “Spectral conditions for a graph to be k-connected,” Annals of Pure and Applied Mathematics, vol. 8, no. 1, pp. 11–14, 2014.
View at: Google Scholar
L.-H. Feng, P.-L. Zhang, H. Liu, W.-J. Liu, M.-M. Liu, and Y.-Q. Hu, “Spectral conditions for some graphical properties,” Linear Algebra and Its Applications, vol. 524, pp. 182–198, 2017.
View at: Google Scholar
L. Feng, P. Zhang, and W. Liu, “Spectral radius and k-connectedness of a graph,” Monatshefte für Mathematik, vol. 185, no. 4, pp. 651–661, 2018.
View at: Publisher Site | Google Scholar
A. Abiad, B. Brimkov, and X. Martínez-Rivera, “Spectral bounds for the connectivity of regular graphs with given order,” The Electronic Journal of Linear Algebra, vol. 34, pp. 428–443, 2018.
View at: Publisher Site | Google Scholar
S. M. Cioabă and X. Gu, “Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs,” Czechoslovak Mathematical Journal, vol. 66, no. 3, pp. 913–924, 2016.
View at: Google Scholar
S. O., “The second largest eigenvalues and vertex-connectivity of regular multigraphs,” Discrete Applied Mathematics, vol. 279, pp. 118–124, 2020.
View at: Google Scholar
W. Zhang, “Matching extendability and connectivity of regular graphs from eigenvalues,” Graphs and Combinatorics, vol. 36, no. 1, pp. 93–108, 2020.
View at: Publisher Site | Google Scholar
Z.-M. Hong, Z.-J. Xia, and H.-J. Lai, “Vertex-connectivity and eigenvalues of graphs,” Linear Algebra and Its Applications, vol. 579, pp. 72–88, 2019.
View at: Google Scholar
Z.-M. Hong, H.-J. Lai, and Z.-J. Xia, “Connectivity and eigenvalues of graphs with given girth or clique number,” Linear Algebra and Its Applications, vol. 607, pp. 319–340, 2020.
View at: Publisher Site | Google Scholar
Z.-M. Hong, Z.-J. Xia, H.-J. Lai, and R. Liu, “Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number,” Linear Algebra and Its Applications, vol. 611, pp. 135–147, 2021.
View at: Publisher Site | Google Scholar
R. Liu, H.-J. Lai, Y. Tian, and Y. Wu, “Vertex-connectivity and eigenvalues of graphs with fixed girth,” Applied Mathematics and Computation, vol. 344-345, pp. 141–149, 2019.
View at: Publisher Site | Google Scholar
Y. Hong, J.-L. Shu, and K. Fang, “A sharp upper bound of the spectral radius of graphs,” Journal of Combinatorial Theory, Series B, vol. 81, no. 2, pp. 177–183, 2001.
View at: Publisher Site | Google Scholar
W. Mantel, “Problem 28,” Wiskundige Opgaven, vol. 10, pp. 60-61, 1907.
View at: Google Scholar
P. Turán, “On an extremal problem in graph theory (Hungarian),” Mat Fiz. Lapok, vol. 48, pp. 436–452, 1941.
View at: Google Scholar

Copyright

Copyright © 2021 Zhen-Mu Hong et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

1299

Downloads

927

Citations