LAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS
|
|
- Jane Horton
- 5 years ago
- Views:
Transcription
1 Kragujevac Journal of Mathematics Volume 39() (015), Pages LAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS HARISHCHANDRA S. RAMANE 1, GOURAMMA A. GUDODAGI 1, AND IVAN GUTMAN Abstract. The Laplacian energy of a graph G with n vertices and m edges is defined as LE(G) = n µ i m/n, where µ 1, µ,..., µ n are the Laplacian eigenvalues of G. If two graphs G 1 and G have equal average vertex degrees, then LE(G 1 G ) = LE(G 1 ) LE(G ). Otherwise, this identity is violated. We determine a term Ξ, such that LE(G 1 ) LE(G ) Ξ LE(G 1 G ) LE(G 1 )LE(G )Ξ holds for all graphs. Further, by calculating LE of the Cartesian product of some graphs, we construct new classes of Laplacian non-cospectral, Laplacian equienergetic graphs. 1. Introduction Let G be a finite, simple, undirected graph with n vertices v 1, v,..., v n and m edges. In what follows, we say that G is an (n, m)-graph. Let A(G) be the adjacency matrix of G and let λ 1, λ,..., λ n be its eigenvalues. Let D(G) be the diagonal matrix whose (i, i)-th entry is the degree of a vertex v i. The matrix C(G) = D(G) A(G) is called the Laplacian matrix of G. The Laplacian polynomial of G is defined as ψ(g, µ) = det[µi C(G)], where I is an identity matrix. The eigenvalues of C(G), denoted by µ i = µ i (G), i = 1,,..., n, are called the Laplacian eigenvalues of G [16]. Two graphs are said to be Laplacian cospectral if they have same Laplacian eignevalues. The adjacency eigenvalues and Laplacian eigenvalues satisfies the following conditions: λ i = 0 and µ i = m. Key words and phrases. Laplacian spectrum, Laplacian energy, Cartesian product, Laplacian equienergetic graphs. 010 Mathematics Subject Classification. Primary: 05C50, 05C75 Received: September, 015. Accepted: November 11,
2 194 H. RAMANE, G. GUDODAGI, AND I. GUTMAN The energy of a graph G is defined as E = E(G) = λ i. It was introduced by one of the present authors in the 1970s, and since then has been much studied in both chemical and mathematical literature. For details see the book [15] and the references cited therein. The Laplacian energy of a graph was introduced a few years ago [13] and is defined as LE(G) = µ i(g) m n. This definition is chosen so as to preserve the main features of the ordinary graph energy E, see [18]. Basic properties and other results on Laplacian energy can be found in the survey [1], the recent papers [6 8, 11, 1, 17, 19], and the references cited therein.. Laplacian Energy of Union of Graphs Let G 1 and G be two graphs with disjoint vertex sets. Let for i = 1,, the vertex and edges sets of G i be, respectively, V i and E i. The union of G 1 and G is a graph G 1 G with vertex set V 1 V and the edge set E 1 E. If G 1 is an (, m 1 )-graph and G is an (n, m )-graph then G 1 G has n vertices and m 1 m edges. It is easy to see that the Laplacian spectrum of G 1 G is the union of the Laplacian spectra of G 1 and G. In [13] it was proven that if G 1 and G have equal average vertex degrees, then LE(G 1 G ) = LE(G 1 ) LE(G ). If the average vertex degrees are not equal, that is m 1 m n, then it may be either LE(G 1 G ) > LE(G 1 ) LE(G ) or LE(G 1 G ) < LE(G 1 )LE(G ) or, exceptionally, LE(G 1 G ) = LE(G 1 )LE(G ) [13]. In this section we study the Laplacian establish some additional relations between LE(G 1 G ) and LE(G 1 ) LE(G ). Theorem.1. Let G 1 be an (, m 1 )-graph and G be an (n, m )-graph, such that m 1. Then > m n LE(G 1 ) LE(G ) 4(n m 1 m ) n LE(G 1 G ) (.1) LE(G 1 ) LE(G ) 4(n m 1 m ) n.
3 LAPLACIAN ENERGY 195 Proof. For the sake of simplicity, denote G 1 G by G. Then G is an ( n, m 1 m )- graphs. By the definition of Laplacian energy, (.) LE(G 1 G ) = 1 n µ i(g) (m 1 m ) n = µ i(g) (m n1n 1 m ) n µ i(g) (m 1 m ) n i= 1 = µ i(g 1 ) (m n 1 m ) n µ i(g ) (m 1 m ) n = µ i(g 1 ) m 1 m 1 (m 1 m ) n n µ i(g ) m m (m 1 m ) n n n µ i(g 1 ) m 1 n m 1 1 (m 1 m ) n n µ i(g ) m n n m (m 1 m ) n n. Since n m 1 > m, Eq. (.) becomes ( m1 LE(G 1 G ) LE(G 1 ) (m ) 1 m ) n ( LE(G ) n m (m ) 1 m ) n n = LE(G 1 ) LE(G ) 4(n m 1 m ) n which is an upper bound. To obtain the lower bound, we just have to note that in full analogy to the above arguments, LE(G 1 G ) µ i(g 1 ) m 1 n m 1 1 (m 1 m ) n
4 196 H. RAMANE, G. GUDODAGI, AND I. GUTMAN (.3) n µ i(g ) m n n m (m 1 m ) n n. Since n m 1 > m, the Eq. (.3) becomes ( m1 LE(G 1 G ) LE(G 1 ) (m ) 1 m ) n ( LE(G ) n m (m ) 1 m ) n n which is a lower bound. = LE(G 1 ) LE(G ) 4(n m 1 m ) n Corollary.1. [13] Let G 1 be an (, m 1 )-graph and G be (n, m )-graph such that m 1. Then = m n LE(G 1 G ) = LE(G 1 ) LE(G ). Corollary.. Let G 1 be an r 1 -regular graph on vertices and G be an r -regular graph on n vertices, such that r 1 > r. Then LE(G 1 ) LE(G ) n (r 1 r ) n LE(G 1 G ) LE(G 1 ) LE(G ) n (r 1 r ) n. Proof. Result follows by setting m 1 = r 1 / and m = n r / into Theorem.1. Theorem.. Let G be an (n, m)-graph and G be its complement, and let m > n(n 1)/4. Then LE(G)LE(G) [ 4m n(n 1) ] LE(G G) LE(G)LE(G) [ 4m n(n 1) ]. Proof. G is a graph with n vertices and n(n 1)/ m edges. Substituting this into Eq. (.1), the result follows. Theorem.3. Let G be an (n, m)-graph and G be the graph obtained from G by removing k edges, 0 k m. Then LE(G) LE(G ) k LE(G G ) LE(G) LE(G ) k. Proof. The number of vertices of G is n and the number of edges is m k. Substituting this in Eq. (.1), the result follows.
5 LAPLACIAN ENERGY Laplacian Energy of Cartesian Product Let G be a graph with vertex set V 1 and H be a graph with vertex set V. The Cartesian product of G and H, denoted by G H is a graph with vertex set V 1 V, such that two vertices (u 1, v 1 ) and (u, v ) are adjacent in G H if and only if either u 1 = u and v 1 is adjacent to v in H or v 1 = v and u 1 is adjacent to u in G [14]. [ ] A0 A Lemma 3.1. [9] Let A = 1 be a symmetric block matrix. Then the A 1 A 0 spectrum of A is the union of the spectra of A 0 A 1 and A 0 A 1. Theorem 3.1. If µ 1, µ,..., µ n are the Laplacian eigenvalues of a graph G, then the Laplacian eigenvalues of G K are µ 1, µ,..., µ n and µ 1, µ,..., µ n. Proof. The Laplacian matrix of G K is [ ] C(G) I I C(G K ) = = I C(G) I [ ] C0 C 1 C 1 C 0 where C(G) is the Laplacian matrix of G and I is an identity matrix of order n. By Lemma 3.1, the Laplacian spectrum of G K is the union of the spectra of C 0 C 1 and C 0 C 1. Here C 0 C 1 = C(G). Therefore, the eigenvalues of C 0 C 1 are the Laplacian eigenvalues of G. Because C 0 C 1 = C(G) I, the characteristic polynomial of C 0 C 1 is ψ(c 0 C 1, µ) = det [ µi (C 0 C 1 ) ] = det [ µi (C(G) I) ] = det [ (µ )I C(G)) ] = ψ(g, µ ). Therefore the eigenvalues of C 0 C 1 are µ i, i = 1,,..., n. The Laplacian eigenvalues of the complete graph K n are n (n 1 times) and 0. The Laplacian eigenvalues of the complete bipartite regular graph K k,k are k, k (k times) and 0. The Laplacian eigenvalues of the cocktail party graph CP (k) (the regular graph on n = k vertices and of degree k ) are k (k 1 times), k (k times) and 0 [16]. Applying Theorem 3.1, we directly arrive at the following example. Example 3.1. LE(K n K ) = LE(K k,k K ) = { 4n 4, if n >, n, if n, { 8k 4, if k > 1, 6k, if k = 1, LE(CP (k) K ) = 10k 8, if k. Theorem 3.. Let G be an (n, m)-graph. Then [LE(G) n] LE(G K ) [LE(G) n].
6 = m m n m m n =. 198 H. RAMANE, G. GUDODAGI, AND I. GUTMAN Proof. Let µ 1, µ,..., µ n be the Laplacian eigenvalues of G. Then by Theorem 3.1, the Laplacian eigenvalues of G K are µ i, i = 1,,..., n and µ i, i = 1,,..., n. The graph G K has n vertices and m n edges. Therefore, (3.1) LE(G K ) = = µ i (m n) n µ i m n 1 µ i µ i m n 1. (m n) n Equation (3.1) can be rewritten as LE(G K ) µ i m n n µ i m n n = LE(G) n which is an upper bound. For lower bound, Eq. (3.1) can be rewritten as LE(G K ) µ i m n n µ i m n n = LE(G) n. Theorem 3.3. For a graph G with n vertices, LE(G K ) n. Proof. From Eq. (3.1) ( LE(G K ) µ i m ) n 1 ( µ i m ) n 1 4. Laplacian Equienergetic Graphs Two graphs G 1 and G are said to be equienergetic if E(G 1 ) = E(G ) []. For details see the book [15]. In analogy to this, two graphs G 1 and G are said to be Laplacian equienergetic if LE(G 1 ) = LE(G ). Obviously Laplacian cospectral graphs are Laplacian equienergetic. Therefore we are interested in Laplacian non-cospectral graphs with equal number of vertices, having equal Laplacian energies. Stevanović [4] has constructed Laplacian equienergetic threshold graphs. Fritscher et al. [10] discovered a family of Laplacian equienergetic unicyclic graphs. We now report some additional classes of such graphs. The line graph of the graph G, denoted by L(G), is a graph whose vertices corresponds to the edges of G and two vertices in L(G) are adjacent if and only if the corresponding edges are adjacent in G [14]. The k-th iterated line graph of G is defined
7 LAPLACIAN ENERGY 199 as L k (G) = L(L k 1 (G)) where L 0 (G) G and L 1 (G) L(G). If G is a regular graph of order n 0 and of degree r 0, then L(G) is a regular graph of order = n 0 r 0 / and of degree r 1 = r 0. Consequently, the order and degree of L k (G) are [3, 4]: n k = 1 n k 1r k 1 and r k = r k 1 where n i and r i stand for the order and degree of L i (G), i = 0, 1,,.... Therefore [3,4], (4.1) n k = n k 1 0 r k i = n 0 k and i=0 k 1 ( i r 0 i1 ) i=0 (4.) r k = k r 0 k1. Theorem 4.1. [3] If λ 1, λ,..., λ n are the adjacency eigenvalues of a regular graph G of order n and of degree r, then the adjacency eigenvalues of L(G) are λ i r i = 1,,..., n, and n(r )/ times. Theorem 4.. [] If λ 1, λ,..., λ n are the adjacency eigenvalues of a regular graph G of order n and of degree r, then the adjacency eigenvalues of G, the complement of G, are n r 1 and λ i 1, i =, 3,..., n. Theorem 4.3. [16] If λ 1, λ,..., λ n are the adjacency eigenvalues of a regular graph G of order n and of degree r, then its Laplacian eigenvalues are r λ i, i = 1,,..., n. For G being a regular graph of degree r 3, and for k, expressions for E ( L k (G) ) and E ( L k (G) ) were reported in [0, 1]. Theorem 4.4. If G is a regular graph of order n and of degree r 4, then LE(L (G) K ) = 4nr(r ). Proof. Let λ 1, λ,..., λ n be the adjacency eigenvalues of G. Then by Theorem 4.1, the adjacency eigenvalues of L(G) are } λ i r i = 1,,..., n, and (4.3) n(r )/ times. Since L(G) is a regular graph of order nr/ and of degree r, by Eq. (4.3) the adjacency eigenvalues of L (G) are λ i 3r 6 i = 1,,..., n, and (4.4) r 6 n(r )/ times, and nr(r )/ times.
8 00 H. RAMANE, G. GUDODAGI, AND I. GUTMAN Since L (G) is a regular graph of order nr(r 1)/ and of degree 4r, by Theorem 4.3 and Eq. (4.4), the Laplacian eigenvalues of L (G) are (4.5) r λ i i = 1,,..., n, and 4r 4 r n(r )/ times, and nr(r )/ times. Using Theorem 3.1 and Eq. (4.5), the Laplacian eigenvalues of L (G) K are (4.6) r λ i i = 1,,..., n, and r n(r )/ times, and 4r 4 nr(r )/ times, and r λ i i = 1,,..., n, and r n(r )/ times, and 4r nr(r )/ times. The graph L (G) K is a regular graph of order and of degree 4r 5. By Eq. (4.6), the Laplacian energy of L (G) K is computed as LE(L (G) K ) = r λi (4r 5) r (4r 5) n(r ) 4r 4 (4r 5) nr(r ) r λi (4r 5) (4.7) r (4r 5) n(r ) 4r (4r 5) nr(r ) = λi 3r 5 r 5 n(r ) 1 nr(r ) λ i 3r 7 r 7 n(r ) 3 nr(r ). If d max is the greatest vertex degree of a graph, then all its adjacency eigenvalues belongs to the interval [ d max, d max ] [5]. In particular, the adjacency eigenvalues of a regular graph of degree r satisfy the condition r λ i r, i = 1,,..., n.
9 LAPLACIAN ENERGY 01 If r 4 then λ i 3r 5 > 0, λ i 3r 7 > 0, r 5 > 0, and r 7 > 0. Therefore by Eq. (4.7), and bearing in mind that n λ i = 0, LE(L (G) K ) = n(r ) nr(r ) λ i n(3r 5) (r 5) = 4nr(r ). n(r ) 3nr(r ) λ i n(3r 7) (r 7) Corollary 4.1. Let G be a regular graph of order n 0 and of degree r 0 4. Let n k and r k be the order and degree, respectively of the k-th iterated line graph L k (G) of G, k. Then (4.8) LE(L k (G) K ) = 4n k r k (r k ) = 4n k 1 (r k 1 ), k LE(L k (G) K ) = 4n 0 (r 0 ) ( i r 0 i1 ), i=0 ( ) LE(L k rk (G) K ) = 8(n k n k 1 ) = 8n k. r k From Eq. (4.8) we see that the energy of L k (G) K, k is fully determined by the order n and degree r 4 of G. Theorem 4.5. If G is a regular graph of order n and of degree r 3, then ) LE (L (G) K = (nr 4)(4r 6) 4. Proof. Let λ 1, λ,..., λ n be the adjacency eigenvalues of a regular graph G of order n and of degree r 3. Then the adjacency eigenvalues of L (G) are as given by Eq. (4.4). Since L (G) is a regular graph of order nr(r 1)/ and of degree 4r, by Theorem 4. and Eq. (4.4), the adjacency eigenvalues of L (G) are λ i 3r 5 i =, 3,..., n, and r 5 n(r )/ times, and (4.9) 1 nr(r )/ times, and (/) 4r 5.
10 0 H. RAMANE, G. GUDODAGI, AND I. GUTMAN Since L (G) is a regular graph of order nr(r 1)/ and of degree (nr(r 1)/) 4r5, by Theorem 4.3 and Eq. (4.9), the Laplacian eigenvalues of L (G) are (/) r λ i i =, 3,..., n, and (/) r n(r )/ times, and (4.10) (/) 4r 4 nr(r )/ times, and 0. Using Theorem 3.1 and Eq. (4.10), the Laplacian eigenvalues of L (G) K are (/) r λ i i =, 3,..., n, and (4.11) (/) r n(r )/ times, and (/) 4r 4 nr(r )/ times, and 0 1 time, and (/) r λ i i =, 3,..., n, and (/) r n(r )/ times, and (/) 4r 6 nr(r )/ times, and. The graph L (G) K is a regular graph of order and of degree (/) 4r 6. By Eq. (4.11), ) ( LE (L (G) K = r λ i 4r 6) i= ( r ( 4r 4 ( 0 4r 6) i= ) n(r ) 4r 6 ) nr(r ) 4r 6 ( r λ i 4r 6) ( r 4r 6 ) n(r )
11 (4.1) = LAPLACIAN ENERGY 03 ( 4r 6 ( 4r 6) λi 3r 6 r 6 n(r ) i= nr(r ) r 4 n(r ) 0 nr(r ) ) nr(r ) 4r 6 4r 6 λi 3r 4 i= 4r 4. All adjacency eigenvalues of a regular graph of degree r satisfy the condition r λ i r, i = 1,,..., n [5]. Therefore if r 3, then λ i 3r 6 0, λ i 3r 4 0, r 6 0, r 4 0, ( /) 4r 6 < 0, and ( /) 4r 4 < 0. Then from Eq. (4.1), and bearing in mind that n λ i = r, we get ) LE (L (G) K = i= λ i (n 1)(3r 6) (r 3)n(r ) nr(r ) i= 4r 6 λ i (n 1)(3r 4) i= (r )n(r ) = (nr 4)(r 3) 4. 4r 4 Corollary 4.. Let G be a regular graph of order n 0 and of degree r 0 3. Let n k and r k be the order and degree, respectively of the k-th iterated line graph L k (G) of G, k. Then ) LE (L k (G) K = (n k r k 4)(4r k 6) 4 (4.13) = (n k 1 4)(r k 1 ) 4, [ ] ) k n LE (L k 0 (G) K = ( i r k 0 i1 ) 4 ( k r 0 k1 ) 4, i=0
12 04 H. RAMANE, G. GUDODAGI, AND I. GUTMAN ) LE (L k (G) K = 8n kr k r k 4(r k 1). From Eq. (4.13) we see that the energy of L k (G) K, k is fully determined by the order n and degree r 3 of G. Theorem 4.6. Let G 1 and G be two Laplacian non-cospectral, regular graphs of the same order and of the same degree r 4. Then for any k, L k (G 1 ) K and L k (G ) K is a pair of Laplacian non-cospectral, Laplacian equienergetic graphs possessing same number of vertices and same number of edges. Proof. If G is any graph with n vertices and m edges, then G K has n vertices and m n edges. Hence by repeated applications of Eqs. (4.1) and (4.), L k (G 1 ) K and L k (G ) K have same number of vertices and same number of edges. By Eqs. (4.5) and (4.6), if G 1 and G are not Laplacian cospectral, then L k (G 1 ) K and L k (G ) K are not Laplacian cospectral for all k 1. Finally, Eq. (4.8) implies that L k (G 1 ) K and L k (G ) K are Laplacian equienergetic. Theorem 4.7. Let G 1 and G be two Laplacian non-cospectral, regular graphs of the same order and of the same degree r 3. Then for any k, L k (G 1 ) K and L k (G ) K is a pair of Laplacian non-cospectral, Laplacian equienergetic graphs possessing same number of vertices and same number of edges. Proof. The proof is similar to that of Theorem 4.6 by using Eqs. (4.10), (4.11), and (4.13). Acknowledgments. H. S. Ramane is thankful to the University Grants Commission (UGC), Govt. of India, for support through research grant under UPE FAR-II grant No. F 14-3/01 (NS/PE). G. A. Gudodagi is thankful to the Karnatak University, Dharwad, for support through UGC-UPE scholarship No. KU/SCH/UGC-UPE/014-15/901. References [1] E. O. D. Andriantiana, Laplacian energy, in: I. Gutman, X. Li (Eds.), Graph Energies Theory and Applications, Univ. Kragujevac, Kragujevac, 016, pp [] R. Balakrishnan, The energy of a graph, Linear Algebra Appl. 387 (004), [3] F. Buckley, Iterated line graphs, Congr. Numer. 33 (1981), [4] F. Buckley, The size of iterated line graphs, Graph Theory Notes N. Y., 5 (1993), [5] D. Cvetković, M. Doob, H. Sachs, Spectra of Graphs Theory and Application, Academic Press, New York, [6] G. Dahl, The Laplacian energy of threshold graphs and majorization, Linear Algebra Appl. 469 (015), [7] K. C. Das, S. A. Mojallal, Relation between energy and (signless) Laplacian energy of graphs, MATCH Commun. Math. Comput. Chem. 74 (015), [8] K. C. Das, S. A. Mojallal, I. Gutman, On Laplacian energy in terms of graph invariants, Appl. Math. Comput. 68 (015), [9] P. J. Davis, Circulant Matrices, Wiley, New York, 1979.
13 LAPLACIAN ENERGY 05 [10] E. Fritscher, C. Hoppen, V. Trevisan, Unicyclic graphs with equal Laplacian energy, Lin. Multilinear Algebra 6 (014), [11] H. A. Ganie, S. Pirzada, E. T. Baskoro, On energy, Laplacian energy and p-fold graphs, El. J. Graph Theory Appl. 3 (015), [1] I. Gutman, E. Milovanović, I. Milovanović, Bounds for Laplacian type graph energies, Miskolc Math. Notes 16 (015), [13] I. Gutman, B. Zhou, Laplacian energy of a graph, Linear Algebra Appl. 414 (006) [14] F. Harary, Graph Theory, Addison Wesley, Reading, [15] X. Li, Y. Shi, I. Gutman, Graph Energy, Springer, New York, 01. [16] B. Mohar, The Laplacian spectrum of graphs, in: Y. Alavi, G. Chartrand, O. R. Ollermann, A. J. Schwenk (Eds.), Graph Theory, Combinatorics and Applications, Wiley, (1991), pp [17] S. Pirzada, H. A. Ganie, On the Laplacian eigenvalues of a graph and Laplacian energy, Linear Algebra Appl. 486 (015), [18] S. Radenković, I. Gutman, Total π-electron energy and Laplacian energy: How far the analogy goes?, J. Serb. Chem. Soc. 7 (007), [19] H. S. Ramane, S. B. Gudimani, Laplacian polynomial and Laplacian energy of some cluster graphs, Int. J. Sci. Innov. Math. Res. (014) [0] H. S. Ramane, I. Gutman, H. B. Walikar, S. B. Halkarni, Equienergetic complement graphs, Kragujevac J. Sci. 7 (005), [1] H. S. Ramane, H. B. Walikar, S. B. Rao, B. D. Acharya, P. R. Hampiholi, S. R. Jog, I. Gutman, Spectra and energies of iterated line graphs of regular graphs, Appl. Math. Lett. 18 (005), [] H. Sachs, Über selbstkomplementare Graphen, Publ. Math. Debrecen 9 (196), [3] H. Sachs, Über Teiler, Faktoren und charakteristische Polynome von Graphen, Teil II, Wiss. Z. TH Ilmenau 13 (1967), [4] D. Stevanović, Large sets of noncospectral graphs with equal Laplacian energy, MATCH Commun. Math. Comput. Chem. 61 (009), Department of Mathematics, Karnatak University, Dharwad , India address: hsramane@yahoo.com address: gouri.gudodagi@gmail.com Faculty of Science, University of Kragujevac, Kragujevac, Serbia, and State University of Novi Pazar, Novi Pazar, Serbia address: gutman@kg.ac.rs
SEIDEL ENERGY OF ITERATED LINE GRAPHS OF REGULAR GRAPHS
Kragujevac Journal of Mathematics Volume 39(1) (015), Pages 7 1. SEIDEL ENERGY OF ITERATED LINE GRAPHS OF REGULAR GRAPHS HARISHCHANDRA S. RAMANE 1, IVAN GUTMAN, AND MAHADEVAPPA M. GUNDLOOR 3 Abstract.
More informationON EQUIENERGETIC GRAPHS AND MOLECULAR GRAPHS
Kragujevac J. Sci. 29 2007) 73 84. UDC 541.66:547.318 ON EQUIENERGETIC GRAPHS AND MOLECULAR GRAPHS Hanumappa B. Walikar, a Harishchandra S. Ramane, b Ivan Gutman, c Sabeena B. Halkarni a a Department of
More informationEQUIENERGETIC GRAPHS
5 Kragujevac J. Math. 26 (2004) 5 13. EQUIENERGETIC GRAPHS Harishchandra S. Ramane, 1 Hanumappa B. Walikar, 2 Siddani Bhaskara Rao, 3 B. Devadas Acharya, 4 Prabhakar R. Hampiholi, 1 Sudhir R. Jog, 1 Ivan
More informationD-EQUIENERGETIC SELF-COMPLEMENTARY GRAPHS
123 Kragujevac J. Math. 32 (2009) 123 131. D-EQUIENERGETIC SELF-COMPLEMENTARY GRAPHS Gopalapillai Indulal 1 and Ivan Gutman 2 1 Department of Mathematics, St. Aloysius College, Edathua, Alappuzha 689573,
More informationResolvent Energy of Graphs
Resolvent Energy of Graphs I.Gutman 1,2, B.Furtula 1, E.Zogić 2, E.Glogić 2 1 Faculty of Science, University of Kragujevac, Kragujevac, Serbia 2 State University of Novi Pazar, Novi Pazar, Serbia May 19,
More 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 informationOn energy, Laplacian energy and p-fold graphs
Electronic Journal of Graph Theory and Applications 3 (1) (2015), 94 107 On energy, Laplacian energy and p-fold graphs Hilal A. Ganie a, S. Pirzada b, Edy Tri Baskoro c a Department of Mathematics, University
More informationNew Results on Equienergetic Graphs of Small Order
International Journal of Computational and Applied Mathematics. ISSN 1819-4966 Volume 12, Number 2 (2017), pp. 595 602 Research India Publications http://www.ripublication.com/ijcam.htm New Results on
More informationarxiv: v1 [math.co] 30 Dec 2015
Resolvent Energy of Unicyclic, Bicyclic and Tricyclic Graphs arxiv:1512.08938v1 [math.co] 30 Dec 2015 Luiz Emilio Allem 1, Juliane Capaverde 1, Vilmar Trevisan 1, Abstract Ivan Gutman 2,3, Emir Zogić 3,
More informationLaplacian Polynomial and Laplacian Energy of Some Cluster Graphs
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 5, May 2014, PP 448-452 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) wwwarcjournalsorg Laplacian Polynomial
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 informationRELATION BETWEEN ENERGY AND LAPLACIAN ENERGY
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 59 (200) 343-354 ISSN 0340-6253 RELATION BETWEEN ENERGY AND LAPLACIAN ENERGY Ivan Gutman, a NairMariaMaiadeAbreu,
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 informationCHARACTERISTIC POLYNOMIAL OF SOME CLUSTER GRAPHS
Kragujevac Journal of Mathematics Volume 37(2) (2013), Pages 369 373 CHARACTERISTIC POLYNOMIAL OF SOME CLUSTER GRAPHS PRABHAKAR R HAMPIHOLI 1 AND BASAVRAJ S DURGI 2 Abstract The characteristic polynomial
More informationEnergy and Laplacian Energy of Graphs. ALI REZA ASHRAFI Department of Mathematics, University of Kashan, Kashan , I. R.
Energy and Laplacian Energy of Graphs ALI REZA ASHRAFI Department of Mathematics, University of Kashan, Kashan 87317-51167, I. R. Iran E-mail: ashrafi@kashanu.ac.ir Contents Laplacian Matrix Laplacian
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 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 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 informationBulletin T.CXXII de l Académie Serbe des Sciences et des Arts Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 26
Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts - 001 Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 6 SOME SPECTRAL PROPERTIES OF STARLIKE TREES M. LEPOVIĆ, I.
More informationLAPLACIAN ENERGY FOR A BALANCED GRAPH
LAPLACIAN ENERGY FOR A BALANCED GRAPH Dr. K. Ameenal Bibi 1, B. Vijayalakshmi 2 1,2 Department of Mathematics, 1,2 D.K.M College for Women (Autonomous), Vellore 632 001, India Abstract In this paper, we
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 informationA Survey on Energy of Graphs
Annals of Pure and Applied Mathematics Vol. 8, No. 2, 2014, 183-191 ISSN: 2279-087X (P), 2279-0888(online) Published on 17 December 2014 www.researchmathsci.org Annals of A Survey on Energy of Graphs S.Meenakshi
More informationENERGY OF SOME CLUSTER GRAPHS
51 Kragujevac J. Sci. 23 (2001) 51-62. ENERGY OF SOME CLUSTER GRAPHS H. B. Walikar a and H. S. Ramane b a Karnatak University s Kittur Rani Chennama Post Graduate Centre, Department of Mathematics, Post
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 informationOn the eigenvalues of Euclidean distance matrices
Volume 27, N. 3, pp. 237 250, 2008 Copyright 2008 SBMAC ISSN 00-8205 www.scielo.br/cam On the eigenvalues of Euclidean distance matrices A.Y. ALFAKIH Department of Mathematics and Statistics University
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 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 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 informationJournal of Mathematical Nanoscience. On borderenergetic and L-borderenergetic graphs
Journal of Mathematical Nanoscienese 7 (2) (2017) 71 77 Journal of Mathematical Nanoscience Available Online at: http://jmathnano.sru.ac.ir On borderenergetic and L-borderenergetic graphs Mardjan Hakimi-Nezhaad
More informationHOSOYA POLYNOMIAL OF THORN TREES, RODS, RINGS, AND STARS
Kragujevac J. Sci. 28 (2006) 47 56. HOSOYA POLYNOMIAL OF THORN TREES, RODS, RINGS, AND STARS Hanumappa B. Walikar, a Harishchandra S. Ramane, b Leela Sindagi, a Shailaja S. Shirakol a and Ivan Gutman c
More informationMaximum Size of Maximally Irregular Graphs
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 76 (2016) 81-98 ISSN 0340-6253 Maximum Size of Maximally Irregular Graphs Batmend Horoldagva 1,2,, Lkhagva
More informationarxiv: v1 [math.co] 6 Feb 2011
arxiv:1102.1144v1 [math.co] 6 Feb 2011 ON SUM OF POWERS OF LAPLACIAN EIGENVALUES AND LAPLACIAN ESTRADA INDEX OF GRAPHS Abstract Bo Zhou Department of Mathematics, South China Normal University, Guangzhou
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 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 informationA note on the Laplacian Estrada index of trees 1
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 63 (2009) 777-782 ISSN 0340-6253 A note on the Laplacian Estrada index of trees 1 Hanyuan Deng College of
More informationEstrada Index of Graphs
Estrada Index of Graphs Mohammed Kasim 1 Department of Mathematics, University of Kashan, Kashan, Iran Email: kasimmd@kashanu.ac.ir Fumao Zhang, Qiang Wang Department of Mathematics, Xi an University of
More informationSTRONGLY REGULAR INTEGRAL CIRCULANT GRAPHS AND THEIR ENERGIES
BULLETIN OF INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN 1840-4367 Vol. 2(2012), 9-16 Former BULLETIN OF SOCIETY OF MATHEMATICIANS BANJA LUKA ISSN 0354-5792 (o), ISSN 1986-521X (p) STRONGLY REGULAR
More informationCOUNTING RELATIONS FOR GENERAL ZAGREB INDICES
Kragujevac Journal of Mathematics Volume 38(1) (2014), Pages 95 103. COUNTING RELATIONS FOR GENERAL ZAGREB INDICES G. BRITTO ANTONY XAVIER 1, E. SURESH 2, AND I. GUTMAN 3 Abstract. The first and second
More 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 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 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 informationEnergy of a polynomial and the Coulson integral formula
J Math Chem (21) 48:162 168 DOI 1.17/s191-1-9725-z ORIGINAL PAPER Energy of a polynomial and the Coulson integral formula Miodrag Mateljević Vladimir Božin Ivan Gutman Received: 3 November 29 / Accepted:
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 informationThe energy of integral circulant graphs
Applied Linear Algebra ALA 200 Faculty of Sciences and Mathematics University of Niš, Serbia Novi Sad, May 200 Graph energy Integral circulant graphs Recent applications Let G be a simple graph with n
More informationZagreb indices of block-edge transformation graphs and their complements
Indonesian Journal of Combinatorics 1 () (017), 64 77 Zagreb indices of block-edge transformation graphs and their complements Bommanahal Basavanagoud a, Shreekant Patil a a Department of Mathematics,
More informationGraphs with Integer Matching Polynomial Roots
Graphs with Integer Matching Polynomial Roots S. Akbari a, P. Csikvári b, A. Ghafari a, S. Khalashi Ghezelahmad c, M. Nahvi a a Department of Mathematical Sciences, Sharif University of Technology, Tehran,
More informationCharacteristic polynomials of skew-adjacency matrices of oriented graphs
Characteristic polynomials of skew-adjacency matrices of oriented graphs Yaoping Hou Department of Mathematics Hunan Normal University Changsha, Hunan 410081, China yphou@hunnu.edu.cn Tiangang Lei Department
More informationOn the Laplacian Energy of Windmill Graph. and Graph D m,cn
International Journal of Contemporary Mathematical Sciences Vol. 11, 2016, no. 9, 405-414 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2016.6844 On the Laplacian Energy of Windmill Graph
More informationLAPLACIAN ESTRADA INDEX OF TREES
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 63 (009) 769-776 ISSN 0340-653 LAPLACIAN ESTRADA INDEX OF TREES Aleksandar Ilić a and Bo Zhou b a Faculty
More 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 informationOn Degree Sum Energy of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 9, No. 3, 2016, 30-35 ISSN 1307-553 www.ejpam.com On Degree Sum Energy of a Graph Sunilkumar M. Hosamani 1,, Harishchandra S. Ramane 2 1 Department
More informationThe Local Spectra of Regular Line Graphs
The Local Spectra of Regular Line Graphs M. A. Fiol a, M. Mitjana b, a Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya Barcelona, Spain b Departament de Matemàtica Aplicada I
More informationarxiv: v1 [cs.ds] 11 Oct 2018
Path matrix and path energy of graphs arxiv:1810.04870v1 [cs.ds] 11 Oct 018 Aleksandar Ilić Facebook Inc, Menlo Park, California, USA e-mail: aleksandari@gmail.com Milan Bašić Faculty of Sciences and Mathematics,
More informationOn the Energy of Some Graphs
nnals of Pure and pplied Mathematics Vol. 7, No., 08, 5- ISSN: 79-087X P, 79-0888online Published on pril 08 www.researchmathsci.org DOI: http://dx.doi.org/0.57/apam.v7na nnals of On the Energy of Some
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 informationAdjacency Matrix of Product of Graphs
Kalpa Publications in Computing Volume 2, 2017, Pages 158 165 ICRISET2017 International Conference on Research and Innovations in Science, Engineering &Technology Selected Papers in Computing Adjacency
More informationOn the normalized Laplacian energy and general Randić index R 1 of graphs
On the normalized Laplacian energy and general Randić index R of graphs Michael Cavers a Shaun Fallat a Steve Kirkland ab3 a Department of Mathematics and Statistics University of Regina Regina SK Canada
More information(Received: 19 October 2018; Received in revised form: 28 November 2018; Accepted: 29 November 2018; Available Online: 3 January 2019)
Discrete Mathematics Letters www.dmlett.com Discrete Math. Lett. 1 019 1 5 Two upper bounds on the weighted Harary indices Azor Emanuel a, Tomislav Došlić b,, Akbar Ali a a Knowledge Unit of Science, University
More 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 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 informationSKEW-SPECTRA AND SKEW ENERGY OF VARIOUS PRODUCTS OF GRAPHS. Communicated by Ivan Gutman
Transactions on Combinatorics ISSN (print: 2251-8657, ISSN (on-line: 2251-8665 Vol. 4 No. 2 (2015, pp. 13-21. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir SKEW-SPECTRA AND SKEW ENERGY
More informationarxiv: v1 [math.sp] 11 Jun 2018
On the diameter and incidence energy of iterated total graphs Eber Lenes a, Exequiel Mallea-Zepeda b, María Robbiano c, Jonnathan Rodríguez c a Departamento de Investigaciones, Universidad del Sinú. Elías
More informationSome constructions of integral graphs
Some constructions of integral graphs A. Mohammadian B. Tayfeh-Rezaie School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran ali m@ipm.ir tayfeh-r@ipm.ir
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 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 informationSolutions to Unsolved Problems on the Minimal Energies of Two Classes of Graphs
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 66 (2011) 943-958 ISSN 0340-6253 Solutions to Unsolved Problems on the Minimal Energies of Two Classes of
More 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 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 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 informationTHE EDGE VERSIONS OF THE WIENER INDEX
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 61 (2009) 663-672 ISSN 0340-6253 THE EDGE VERSIONS OF THE WIENER INDEX Ali Iranmanesh, a Ivan Gutman, b
More informationNew Approaches for the Real and Complex Integral Formulas of the Energy of a Polynomial
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 66 (0) 849-86 ISSN 0340-653 New Approaches for the Real and Complex Integral Formulas of the Energy of a
More informationOn the Leap Zagreb Indices of Generalized xyz-point-line Transformation Graphs T xyz (G) when z = 1
International J.Math. Combin. Vol.(018), 44-66 On the Leap Zagreb Indices of Generalized xyz-point-line Transformation Graphs T xyz (G) when z 1 B. Basavanagoud and Chitra E. (Department of Mathematics,
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 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 MATCHING ENERGY OF A GRAPH
THE MATCHING ENERGY OF A GRAPH IVAN GUTMAN AND STEPHAN WAGNER Abstract. The energy of a graph G is equal to the sum of the absolute values of the eigenvalues of G. We define the matching energy ME of the
More informationBOUNDS FOR LAPLACIAN SPECTRAL RADIUS OF THE COMPLETE BIPARTITE GRAPH
Volume 115 No. 9 017, 343-351 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu BOUNDS FOR LAPLACIAN SPECTRAL RADIUS OF THE COMPLETE BIPARTITE GRAPH
More informationOn π-electron configuration of cyclopenta-derivatives of benzenoid hydrocarbons
Indian Journal of Chemistry Vol. 49, July 010, pp. 853-860 On π-electron configuration of cyclopenta-derivatives of benzenoid hydrocarbons Ivan Gutman*, Jelena Đurđević, Dušan Bašić & Dragana Rašović Faculty
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 informationTHE GRAPHS WHOSE PERMANENTAL POLYNOMIALS ARE SYMMETRIC
Discussiones Mathematicae Graph Theory 38 (2018) 233 243 doi:10.7151/dmgt.1986 THE GRAPHS WHOSE PERMANENTAL POLYNOMIALS ARE SYMMETRIC Wei Li Department of Applied Mathematics, School of Science Northwestern
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 informationAN EXAMPLE OF USING STAR COMPLEMENTS IN CLASSIFYING STRONGLY REGULAR GRAPHS
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.yu/filomat Filomat 22:2 (2008), 53 57 AN EXAMPLE OF USING STAR COMPLEMENTS IN CLASSIFYING STRONGLY REGULAR
More informationMaximal Energy Graphs
Advances in Applied Mathematics 6, 47 5 (001) doi:10.1006/aama.000.0705, available online at http://www.idealibrary.com on Maximal Energy Graphs Jack H. Koolen 1 FSPM-Strukturbildungsprozesse, University
More informationMaximum volume simplices and trace-minimal graphs
Maximum volume simplices and trace-minimal graphs January 11, 2004 Abstract Let (v, δ) be the set of all δ-regular graphs on v vertices. A graph G (v, δ) is trace-minimal in (v, δ) if the vector whose
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 informationarxiv: v1 [math.co] 13 Mar 2018
A note on polyomino chains with extremum general sum-connectivity index Akbar Ali, Tahir Idrees arxiv:1803.04657v1 [math.co] 13 Mar 2018 Knowledge Unit of Science, University of Management & Technology,
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 informationA NOVEL/OLD MODIFICATION OF THE FIRST ZAGREB INDEX
A NOVEL/OLD MODIFICATION OF THE FIRST ZAGREB INDEX AKBAR ALI 1 AND NENAD TRINAJSTIĆ arxiv:1705.1040v1 [math.co] 0 May 017 Abstract. In the paper [Gutman, I.; Trinajstić, N. Chem. Phys. Lett. 197, 17, 55],
More informationRELATION BETWEEN WIENER INDEX AND SPECTRAL RADIUS
Kragujevac J. Sci. 30 (2008) 57-64. UDC 541.61 57 RELATION BETWEEN WIENER INDEX AND SPECTRAL RADIUS Slavko Radenković and Ivan Gutman Faculty of Science, P. O. Box 60, 34000 Kragujevac, Republic of Serbia
More informationTOWARDS A SPECTRAL THEORY OF GRAPHS BASED ON THE SIGNLESS LAPLACIAN, I. Dragoš Cvetković and Slobodan K. Simić
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 85(99) (2009), 19 33 DOI:10.2298/PIM0999019C TOWARDS A SPECTRAL THEORY OF GRAPHS BASED ON THE SIGNLESS LAPLACIAN, I Dragoš Cvetković and Slobodan
More informationSOME VERTEX-DEGREE-BASED TOPOLOGICAL INDICES UNDER EDGE CORONA PRODUCT
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 38 07 8 9 8 SOME VERTEX-DEGREE-BASED TOPOLOGICAL INDICES UNDER EDGE CORONA PRODUCT I. Rezaee Abdolhosseinzadeh F. Rahbarnia M. Tavaoli Department of Applied
More informationOn trees with smallest resolvent energies 1
On trees with smallest resolvent energies 1 Mohammad Ghebleh, Ali Kanso, Dragan Stevanović Faculty of Science, Kuwait University, Safat 13060, Kuwait mamad@sci.kuniv.edu.kw, akanso@sci.kuniv.edu.kw, dragance106@yahoo.com
More informationMore on Zagreb Coindices of Composite Graphs
International Mathematical Forum, Vol. 7, 2012, no. 14, 669-673 More on Zagreb Coindices of Composite Graphs Maolin Wang and Hongbo Hua Faculty of Mathematics and Physics Huaiyin Institute of Technology
More information1. Introduction and Basic Definitions
Discussiones Mathematicae Graph Theory 24 (2004 ) 509 527 DIFFERENCE LABELLING OF DIGRAPHS Martin Sonntag Faculty of Mathematics and Computer Science TU Bergakademie Freiberg Agricola Str. 1, D 09596 Freiberg,
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 informationBOUNDS FOR THE DISTANCE ENERGY OF A GRAPH
59 Kragujevac J. Math. 31 (2008) 59 68. BOUNDS FOR THE DISTANCE ENERGY OF A GRAPH Harishchadra S. Ramae 1, Deepak S. Revakar 1, Iva Gutma 2, Siddai Bhaskara Rao 3, B. Devadas Acharya 4 ad Haumappa B. Walikar
More informationLower bounds for the Estrada index
Electronic Journal of Linear Algebra Volume 23 Volume 23 (2012) Article 48 2012 Lower bounds for the Estrada index Yilun Shang shylmath@hotmail.com Follow this and additional works at: http://repository.uwyo.edu/ela
More informationMORE GRAPHS WHOSE ENERGY EXCEEDS THE NUMBER OF VERTICES
Iraia Joural of Mathematical Scieces ad Iformatics Vol. 2, No. 2 (2007), pp 57-62 MORE GRAPHS WHOSE ENERGY EXCEEDS THE NUMBER OF VERTICES CHANDRASHEKAR ADIGA, ZEYNAB KHOSHBAKHT ad IVAN GUTMAN 1 DEPARTMENT
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 informationWhen can the components of NEPS of connected bipartite graphs be almost cospectral?
When can the components of NEPS of connected bipartite graphs be almost cospectral? Dragan Stevanović Department of Mathematics, Faculty of Science, Ćirila i Metodija 2, Niš 18000, Yugoslavia dragance@pmf.pmf.ni.ac.yu
More 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 information