MPEMathematical Problems in Engineering1563-51471024-123XHindawi10.1155/2020/57632185763218Research ArticleAlgebraic Connectivity and Disjoint Vertex Subsets of GraphsSunYan1https://orcid.org/0000-0001-9141-9277LiFaxu2LiuJia-Bao1School of ComputerQinghai Nationalities UniversityXining 810007Chinaqhmu.edu.cn2School of ComputerQinghai Normal UniversityXining 810016Chinaqhnu.edu.cn202031720202020010620200807202031720202020Copyright © 2020 Yan Sun and Faxu Li.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.

It is well known that the algebraic connectivity of a graph is the second small eigenvalue of its Laplacian matrix. In this paper, we mainly research the relationships between the algebraic connectivity and the disjoint vertex subsets of graphs, which are presented through some upper bounds on algebraic connectivity.

Ministry of Education of the People's Republic of ChinaZ2017046Qinghai Science and Technology Planning Project2018-ZJ-718
1. Introduction

A graph G is often used to model a complex network. The vertex set and the edge set of graph G are denoted by N and , respectively. A network is represented as an undirected graph G=N, consisting of N=N nodes and E= links, respectively.

Graph theory has provided chemists with a variety of useful tools, such as in the topological structure . The Laplacian matrix of a graph G is denoted by L, and L=DA, where D is a diagonal matrix whose diagonal entries are its degrees and A is the adjacency matrix of G. The Laplacian eigenvalues of a graph G are the eigenvalues of L, denoted by 0=μNμN1μ1, which are all real and nonnegative. The second smallest Laplacian eigenvalue μN1 of a graph is well known as the algebraic connectivity, which was first studied by Fiedler . The algebraic connectivity  of a graph is important for the connectivity of a graph , which can be used to measure the robustness of a graph. It has been emerged as an important parameter in many system problems . Especially, the algebraic connectivity also plays an important role in the partitions of a complex network. For the literature on the algebraic connectivity of a graph , the reader is referred to [20, 21]. In this work, the relationships are researched between the algebraic connectivity and disjoint vertex subsets of graphs, which are presented through some upper bounds.

2. Preliminaries

Let xRn be a vector. Let B be an incidence matrix of G. Then, xTLx=BTx22=i,jΕxixj2. For any vector x,yRn, the inner product of x and y is defined as x,y. Two upper bounds on the algebraic connectivity are given as follows.

Lemma 1 (see [<xref ref-type="bibr" rid="B20">20</xref>]).

For any vector fRn, the Rayleigh inequality is as follows:(1)μN1Lf,ff,f,where f,c=0, c is a constant, and Lf,f=vi,vjΕfvifvj2, fvi is the vector f for the node vi.

Lemma 2 (see [<xref ref-type="bibr" rid="B20">20</xref>]).

For any vector fRn, we have(2)μN1vivjΕfvifvj2viNf2vi,(3)μN1vi,vjfvifvj2viNvjNfvifvj2,where fvi is the vector f for the node vi.

Let A and B be two disjoint subsets of N, respectively. The distance between two disjoint subsets A and B of N is denoted by hA,B. For continence, h takes the place of hA,B. Let hu,A be the distance between the node u and A, which is the shortest distance of the node uN to a node of the set A. Suppose a=A/N and b=B/N. A result on the algebraic connectivity and two partitions of graphs is presented by Alon  and Milman  below.

Lemma 3 (see [<xref ref-type="bibr" rid="B23">23</xref>]).

For any two disjoint subsets A and B of N, it holds(4)μN11Nh21a+1bEEAEB,where EA and EB are the number of links in the sets A and B, respectively.

Moreover, the next step consider the case of three disjoint vertex subsets of graphs .

3. Main Result

Let A, B, and C be the subsets of N, respectively, where their numbers of nodes are, respectively, A, B, and C. Assume a=A/N,b=B/N, and c=C/N. Let hu,A,hu,B, and hu,C be the distances from the node uN to subsets A,B, and C of N, respectively. Suppose hs=minhA,B,hA,C,hB,C. Now, we construct a function gu related to node u as follows, where the constructed function is referred to the book :(5)gu=131a+1b+1c191a+1b+1c×minhs,hu,A,hu,B,hu,Chs.

Let f=gg¯0, where g¯=1/NnNgn. It is easy to check that f,c=0, where c is a constant function . Meanwhile, g,c0 can be checked. Thus, the following cases need to discussed.

Case 1.

If the node u belongs to any one subset of A,B,C, then(6)0=minhs,hu,A,hu,B,hu,C,(7)gu=131a+1b+1c>0.

Case 2.

If the node uNA,B,C, then we can see that(8)minhs,hu,A,hu,B,hu,Chs1,(9)gu=131a+1b+1c191a+1b+1c×minhs,hu,A,hu,B,hu,Chs>0.

By Case 1 and Case 2, g,c0 holds. In contrast, if g,c=0, then gu=0 for each uN and gg¯=0, which is a contradiction with f=gg¯0. From the definition gu, for any two adjacent nodes u and v, we have(10)gugv19hs1a+1b+1c.

Our main result is as follows.

Theorem 1.

Let A,B, and CN be three disjoint subsets of N. Let EA and EB and EC be the numbers of links in the sets A and B and C, respectively. Then,(11)μN1181N2hs21a+1b+1cEEAEBEC=181Nhs21NA+1NB+1NCEEAEBEC.

Proof.

For subsets A,B, and C, by Lemma 2, we have(12)u,vεfufv2=u,vεgugv2=u,vεABCgugv2181hs21a+1b+1c2EEAEBEC.

From (2) and(13)g¯=1NnNgn,nNf2nnABCgng¯2,where g¯=0, and since the coordinates of the center of gravity of the three regions are the average of the triangle region, then the vectors gu,A+gu,B+gu,C=0. The sum of the vectors of the center of gravity of the triangle to the vertices is equal to 0 . The center of gravity is analogous to the mean or average from statistics [6, 31, 32]:(14)nNf2nnABCf2n=nAgng¯2+nBgng¯2+nCgng¯2=A131a+1b+1cg¯2+B131a+1b+1cg¯2+C131a+1b+1cg¯2=A131a+1b+1c2+B131a+1b+1c2+C131a+1b+1c2=A+B+C131a+1b+1c2=19A1a+B1b+C1c21a+1b+1c=N2191+1+121a+1b+1cN21a+1b+1c.

By the above inequalities and Lemma 2, it arrives that(15)μN1181N2hs21a+1b+1cEEAEBEC=181Nhs21NC+1NB+1NCEEAEBEC.

Example 1.

Figure 1 describes the graphs G1 and G2, each with N=7 nodes, L=10 links, and a diameter ρ=4. For G1 subsets, A=v1v3v5v6v7,B=v2, and C=v4. For G2 subsets, A=u1u2u3,B=u4,C=u5u6u7, and hs=0.5. Their algebraic connectivity  and their upper bounds on (11) are as follows. For the G1 and G2 aplacian matrixes,(16)G1=2110000131010011411000013110011141000011310000011,G2=2110000131010011301000003111011141000011310001012.

For G1, the algebraic connectivity is 0.6338, and the algebraic connectivity of G2 is 0.5858. For G1 upper bounds on μN1G11/81N2hs21/a+1/b+1/cEEAEBEC=0.0931.

For G2 upper bounds on μN1G21/81N2hs21/a+1/b+1/cEEAEBEC=0.0587.

A graph with the second smallest Laplacian eigenvalue μN1 is thus more robust, in the sense of being better connected.

The graphs G1 and G2.

Proposition 1.

Let A,B, and CV be three disjoint subsets of V. Suppose hs=1 and D=VABC. Let mA, mB, mC, and mD be the number of links in the sets A,B,C, and D, respectively. Then,(17)μN11/811/a+1/b+1/c2mmAmBmCmDA+B+C1/a+1/b+1/cg¯2+D2/91/a+1/b+1/cg¯2,where(18)g¯=1n1a+1b+1cA+B+C+29D,in which g¯ is the average of the A,B,C,D field.

Proof.

For subsets A,B, and C, by Lemma 2, we have(19)u,vΕfufv2=u,vΕgugv2=u,vΕEAEBECEDgugv21811a+1b+1c2mmAmBmCmD,where links of the sets in the node sets A, B, C, and D are EA,EB, EC, and ED, respectively. From (2), we obtain(20)nVf2n=nABCDf2n=nAgng¯2+nBgng¯2+vCgng¯2+nDgng¯2=A1a+1b+1cg¯2+B1a+1b+1cg¯2+C1a+1b+1cg¯2+D291a+1b+1cg¯2=A+B+C1a+1b+1cg¯2+D291a+1b+1cg¯2.

By direct computation, we have(21)g¯=1n1a+1b+1cA+B+C+29D.

By the above equalities and Lemma 2, inequality (17) holds.

But, we note that the algebraic connectivity [34, 35], μN1, should not be seen as a strict disconnection or a robustness metric .

Example 2.

For example, Figure 2 describes the graphs G3 and G4, with n=9, m=12, and diameter 6. By direct calculation, for G3 subsets, A=v1v2v3,B=v4v5v6,C=v7, and D=v8v9, and for G4 subsets, A=u1u2u3,B=u4u5u6,C=u7, and D=u8u9. Their algebraic connectivity G3 is 0.4798 and G4 is 0.4817, respectively. Their Laplacian matrices LG3 and LG4, for G3 upper bounds on μN1G30.431 and for G4 upper bounds on μN1G40.357.

Theorem 1 and Proposition 1 are two completely different situations. The theorem hypothesis is that A,B, and CN be three disjoint subsets of N. The proposition supposes that A,B, and CV be three disjoint subsets of V and hs=1 and D=VABC. In other words, the proposition has constraints. Moreover, it is not the same as the four disjoint subsets of N.

The graphs G3 and G4.

Data Availability

All data, models, and codes generated or used during the study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This work was supported by the Chunhui project of the Ministry of Education, China (no. Z2017046) and the Qinghai Science and Technology Planning Project (Grant no. 2018-ZJ-718).

García-DomenechR.GálvezJ.PoglianiL.Some new trends in chemical graph theoryChemical Reviews200810831127116910.1021/cr07800062-s2.0-42149095556de Julián-OrtizJ.-B.WangC.WangS.WeiB.Zagreb indices and multiplicative zagreb indices of eulerian graphsBulletin of the Malaysian Mathematical Sciences Society2019421677810.1007/s40840-017-0463-22-s2.0-85056620341LiuJ.-B.ZhaoJ.MinJ.CaoJ. D.On the Hosoya index of graphs formed by a fractal graphFractals-Complex Geometry Patterns and Scaling in Nature and Society201927810513510.1142/s0218348x19501354FiedlerM.Algebraic connectivity of graphs, CzechJournal of Mathematics197323298305BiggsN. L.Algebraic Graph Theory19932ndCambridge, UKCambridge University PressLiuJ.-B.ZhaoJ.CaiZ.-Q.On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networksPhysica A: Statistical Mechanics and Its Applications202054012307310.1016/j.physa.2019.123073Baeza-YatesR.Ribeiro-NetoB.Modern Information Retrieval1999Boston, MA, USAAddison-WesleyBaldiP.FrasconiP.SmythP.Modeling the Internet and the Web: Probabilistic Methods and Algorithms2003Hoboken, NJ, USAJohn Wiley & SonsBarnettS.Matrices: Methods and Applications1992Oxford, UKOxford University PressChanT. F.CiarletP.SzetoW. K.On the optimality of the median cut spectral bisection graph partitioning methodSIAM Journal on Scientific Computing199718394394810.1137/s10648275942626492-s2.0-0031129194ChandraA. K.RaghavanP.RuzzoW. L.SmolenskyR.TiwariP.The electrical resistance of a graph captures its commute and cover timesProceedings of the twenty-first annual ACM symposium on Theory of computing—STOC ‘89May 1989Seattle WA, USA57458610.1145/73007.73062ChebotarevP.ShamisE.The matrix-forest theorem and measuring relations in small social groupsAutomation and Remote Control199758915051514ChebotarevP.ShamisE.On a duality between metrics and s-proximitiesAutomation and Remote Control1998594608612CheungK.-W.TsuiK.-C.LiuJ.Extended latent class models for collaborative recommendationIEEE Transactions on Systems, Man, and Cybernetics—Part A: Systems and Humans200434114314810.1109/tsmca.2003.8188772-s2.0-0742307431HarelD.KorenY.On clustering using random walksFST TCS 2001: Foundations of Software Technology and Theoretical Computer Science20012245184110.1007/3-540-45294-x_3HerlockerJ. L.KonstanJ. A.TerveenL. G.RiedlJ. T.Evaluating collaborative filtering recommender systemsACM Transactions on Information Systems (TOIS)200422155310.1145/963770.9637722-s2.0-3042697346HoN.-D.Van DoorenP.On the pseudo-inverse of the laplacian of a bipartite graphApplied Mathematics Letters200518891792210.1016/j.aml.2004.07.0342-s2.0-19044386806HuangZ.ChenH.ZengD.Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filteringACM Transactions on Information Systems (TOIS)200422111614210.1145/963770.9637752-s2.0-3042819722BrooksR.FriedmanJ.Spectral geometry and the Cheeger constantExpanding Graphs1993Providence, RI, USAAmerican Mathematical Society51910.1090/dimacs/010/02Van MieghemP.Graph Spectra for Complex Networks2012Delft, NetherlandsDelft University of Technologyde AbreuN. M. M.Old and new results on algebraic connectivity of graphsLinear Algebra and Its Applications20074231537310.1016/j.laa.2006.08.0172-s2.0-33947178314AlonN.Eigenvalues and expandersCombinatorica198662839610.1007/bf025791662-s2.0-51249173340AlonN.MilmanV. D.λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B1985381738810.1016/0095-8956(85)90092-92-s2.0-33750994100ChanP. K.SchlagM.ZienJ.Spectral k-way ratio cut partitioning and clusteringProceedings of the Symposium on Research on integrated systems1993Warwick, UKA Court, Nathan College GeometryAn Introduction to the Modern Geometry of the Triangle and the Circle19252ndNew York, NY, USABarnes & NobleChungF.Spectral Graph Theory1997Providence, RI, USAAMS PublicationsChungF. R. K.Laplacians of graphs and Cheeger inequalitiesCombinatorics, Paul Erdo is Eighty1996Budapest, HungaryJános Bolyai Mathematical Society157172BuserP.Geometry and Spectra of Compact Riemann Surfaces1992Basel, SwitzerlandBirkhauserCheegerJ.GunnigR. C.A lower bound for the smallest eigenvalue of the LaplacianProblems in Analysis1970Princeton, NJ, USAPrinceton University Press195199DelormeC.PoljakS.Laplacian eigenvalues and the maximum cut problemMathematical Programming1993621-355757410.1007/bf015851842-s2.0-34250080270LiuJ.-B.ZhaoJ.HeH.ShaoZ.Valency-based topological descriptors and structural property of the generalized sierpiński networksJournal of Statistical Physics201917761131114710.1007/s10955-019-02412-2LiuJ.-B.ShiZ.-YuPanY.-H.CaoJ.Abdel-AtyM.Udai Al-juboori computing the laplacian spectrum of linear octagonal-quadrilateral networks and its applicationsPolycyclic Aromatic Compounds2020102343CvetkovicD. M.DoobM.GutmanI.Recent Results in the Theory of Graph Spectra, Annals of Discrete Mathematics198836Amsterdam, NetherlandsElsevierGodsilC.RoyleG.Algebraic graph theoryGraduate Texts in Mathematics2001New York, NY, USASpringer-Verlag207KirklandS. J.MolitiernoJ. J.NeumannM.ShaderB. L.On graphs with equal algebraic and vertex connectivityLinear Algebra and Its Applications20023411-3455610.1016/s0024-3795(01)00312-3EdgarG. A.UllmanD. H.WestD. B.Problems and solutionsThe American Mathematical Monthly20181251818910.1080/00029890.2018.13974652-s2.0-85045101845