The energy of integral circulant graphs
|
|
- Tracy Bell
- 6 years ago
- Views:
Transcription
1 Applied Linear Algebra ALA 200 Faculty of Sciences and Mathematics University of Niš, Serbia Novi Sad, May 200
2 Graph energy Integral circulant graphs Recent applications Let G be a simple graph with n vertices and m edges, and let A = [a ij ] be the adjacency matrix for G. The eigenvalues λ, λ 2,..., λ n of A are the eigenvalues of the graph G. A(K 4 ) = A = 3 A = P(x; K 4 ) = (x 3)(x + ) 3 = x 4 6x 2 8x 3
3 Graph energy Integral circulant graphs Recent applications Let G be a simple graph with n vertices and m edges, and let A = [a ij ] be the adjacency matrix for G. The eigenvalues λ, λ 2,..., λ n of A are the eigenvalues of the graph G. A(K 4 ) = A = 3 A = P(x; K 4 ) = (x 3)(x + ) 3 = x 4 6x 2 8x 3
4 Graph energy Integral circulant graphs Recent applications Definition The energy of G is introduced by Ivan Gutman in 978 and defined as the sum of absolute values of its eigenvalues E(G) = n λ i i= The energy is a graph parameter stemming from the Hückel molecular orbital approximation for the total π-electron energy. Motivated by the successes of the theory of graph energy, other energy like quantities have been proposed, based on the eigenvalues of graph matrices other than the adjacency matrix.
5 Graph energy Integral circulant graphs Recent applications Definition The energy of G is introduced by Ivan Gutman in 978 and defined as the sum of absolute values of its eigenvalues E(G) = n λ i i= The energy is a graph parameter stemming from the Hückel molecular orbital approximation for the total π-electron energy. Motivated by the successes of the theory of graph energy, other energy like quantities have been proposed, based on the eigenvalues of graph matrices other than the adjacency matrix.
6 Graph energy Integral circulant graphs Recent applications The distance matrix D of a graph G is the square matrix whose (u, v)-entry is the shortest distance between the vertices u and v. The eigenvalues ρ, ρ 2,..., ρ n of the distance matrix are said to be the distance eigenvalues. The distance energy of a graph G is the sum of absolute values of the distance eigenvalues, DE(G) = n ρ i. i= Distance energy is a useful molecular descriptor in QSPR modeling, as demonstrated by Consonni and Todeschini.
7 Graph energy Integral circulant graphs Recent applications Let L = D A be the Laplacian matrix of the graph G, and µ, µ 2,..., µ n be its eigenvalues. Then the Laplacian energy of G defined by n LE(G) = µ i 2m n where n and m denote the number of vertices and edges. i= For regular graph G, it follows E(G) = LE(G).
8 Graph energy Integral circulant graphs Recent applications Let L = D A be the Laplacian matrix of the graph G, and µ, µ 2,..., µ n be its eigenvalues. Then the Laplacian energy of G defined by n LE(G) = µ i 2m n where n and m denote the number of vertices and edges. i= For regular graph G, it follows E(G) = LE(G).
9 Graph energy Integral circulant graphs Recent applications Two graphs G and G 2 are said to be cospectral if their spectra coincide. In full analogy we speak of pairs of Laplacian cospectral and distance cospectral graphs. Evidently, cospectral graphs have equal energies. However, we are interested in finding pairs of non-cospectral graphs with equal energy. These will be referred to as A-equienergetic. The graph G is said to be hyperenergetic if its energy exceeds the energy of the complete graph K n, or equivalently if E(G) > 2n 2.
10 Graph energy Integral circulant graphs Recent applications Two graphs G and G 2 are said to be cospectral if their spectra coincide. In full analogy we speak of pairs of Laplacian cospectral and distance cospectral graphs. Evidently, cospectral graphs have equal energies. However, we are interested in finding pairs of non-cospectral graphs with equal energy. These will be referred to as A-equienergetic. The graph G is said to be hyperenergetic if its energy exceeds the energy of the complete graph K n, or equivalently if E(G) > 2n 2.
11 Graph energy Integral circulant graphs Recent applications A graph is called circulant if its adjacency matrix is circulant. A graph is called integral if all eigenvalues of its adjacency matrix are integers. So has characterized integral circulant graphs as follows. Let D be a set of positive, proper divisors of the integer n >. Define the graph ICG n (D) so that its vertex set be Z n = {0,,..., n } and its edge set {{a, b} a, b Z n, gcd(a b, n) D}.
12 Graph energy Integral circulant graphs Recent applications A class of integral circulant graphs is the generalization of well-known class of unitary Cayley graphs ICG n () Integral circulant graphs are Cayley graphs of the additive group of Z n and Cayley set S The graph ICG n (D) is regular of degree d D ϕ(n/d), where ϕ(n) denotes the Euler function These graphs are highly symmetric and have some remarkable properties connecting graph theory and number theory
13 Graph energy Integral circulant graphs Recent applications D = Figure: The integral circulant graph ICG 0 () and its distance matrix. λ = { 4, 4,,,,,,,, } E(ICG 0 ()) = 6 ρ = {5, 4, 4, 4, 4,, 0, 0, 0, 0} DE(ICG 0 ()) = 32 µ = {8, 5, 5, 5, 5, 3, 3, 3, 3, 0} LE(ICG 0 ()) = 6
14 Graph energy Integral circulant graphs Recent applications Integral circulant graphs have found important applications: as a class of interconnection networks in parallel and distributed computing as potential candidates for modeling quantum spin networks that might enable the perfect state transfer (PST) between antipodal sites in a network in chemistry, as models for hyperenergetic and equienergetic graphs Recently various graph parameters (such as diameter, clique number, chromatic number, automorphism group) were studied.
15 The Ramanujan function is defined as c(j, n) = gcd(i,n)=, i<n It is well-known from the number theory that where µ is Möbius function. ω ij n. c(j, n) = µ(t n,j ) ϕ(n) ϕ(t n,j ), t n n,j = gcd(n, j) Eigenvalues λ j of integral circulants can be expressed using the Ramanujan function as follows: λ j = d D c(j, n/d).
16 The Ramanujan function is defined as c(j, n) = gcd(i,n)=, i<n It is well-known from the number theory that where µ is Möbius function. ω ij n. c(j, n) = µ(t n,j ) ϕ(n) ϕ(t n,j ), t n n,j = gcd(n, j) Eigenvalues λ j of integral circulants can be expressed using the Ramanujan function as follows: λ j = d D c(j, n/d).
17 For arbitrary divisor d and i n, it holds and t n/d,n i = t n/d,i = n/d gcd(n/d, i) = n gcd(n, id) n/d gcd(n/d, n i) = n gcd(n, nd id). Since gcd(n, id) = gcd(n, nd id), we have t n/d,i = t n/d,n i. Finally, c(n/d, i) = µ(t n/d,i ) ϕ(n/d) ϕ(t n/d,i ) = µ(t ϕ(n/d) n/d,n i) = c(n/d, n i). ϕ(t n/d,n i ) Therefore eigenvalues λ i and λ n i are equal for i n.
18 The distance matrix of ICG n (D) is also circulant matrix and the distance spectrum of ICG n (D) is given by: s s n 2 s diam(g) ρ i = c i, n + 2 c i, n + + diam(g) c i, where j= d () j j= d (2) j D (p) = {d (p), d (p) 2,..., d (p) s p }, p diam(g) j= d (diam(g)) j is the set of divisors determined by the vertices on distance p from the starting vertex 0. Notice that D () = D.
19 Unitary Cayley graphs Equienergetic graphs Energy modulo 4 Theorem The energy of unitary Cayley graph ICG n () equals 2 k ϕ(n), where k is the number of distinct prime factors dividing n. Theorem The distance energy of unitary Caley graph ICG n () equals 2(n ), if n is a prime 4(n 2), if n is a power of 2 4n + 2ϕ(n)(2 DE(ICG n ()) = k ) 2m k i= (2 p i ), if n is odd composite number 9n 2 2m + 2ϕ(n) (2k 3) 2 + 2(ϕ(n) ) n, otherwise 2
20 Unitary Cayley graphs Equienergetic graphs Energy modulo 4 Let n = p α pα 2 2 pα k k, where p < p 2 < < p k are distinct primes, and α i. Lemma If k > 2 or k = 2 and p > 2, the following inequality holds 2 k ϕ(n) > n. Corollary The unitary Cayley graph ICG n () is hyperenergetic if and only if k > 2 or k = 2 and p > 2.
21 Unitary Cayley graphs Equienergetic graphs Energy modulo 4 Theorem Let n = p α pα 2 2 pα k k. For a two-element set of divisors D = {, p}, the energy of the integral circulant graph ICG n (, p) is given by { 2 E(ICG n (, p)) = k (ϕ(n) + ϕ(n/p)), p 2 n 2 k (ϕ(n) + ϕ(n/p)), p 2 n, where p is a prime dividing n.
22 Unitary Cayley graphs Equienergetic graphs Energy modulo 4 Theorem Let n be a square-free number, n = p p 2 p k. Then the energy of integral circulant graph ICG n (p i, p j ) does not depend on the choice of p i and p j, E(ICG n (p i, p j )) = 2 k ϕ(n) = 2 k k (p i ). We can construct at least k non-cospectral regular n-vertex hyperenergetic graphs, ICG n (), ICG n (p, p 2 ), ICG n (p, p 3 ),..., ICG n (p, p k ), with equal energy. i=
23 Unitary Cayley graphs Equienergetic graphs Energy modulo 4 Theorem Let n be a square-free number, n = p p 2 p k. Then the energy of integral circulant graph ICG n (p i, p j ) does not depend on the choice of p i and p j, E(ICG n (p i, p j )) = 2 k ϕ(n) = 2 k k (p i ). We can construct at least k non-cospectral regular n-vertex hyperenergetic graphs, ICG n (), ICG n (p, p 2 ), ICG n (p, p 3 ),..., ICG n (p, p k ), with equal energy. i=
24 Unitary Cayley graphs Equienergetic graphs Energy modulo 4 Using a computer search on graphs with 0 vertices, we concluded that there are no pairs of A, L, and D equienergetic graphs. Let n = 2pq, where p > q > 2 are arbitrary prime numbers. Consider the following integral circulant graphs G n = ICG(2pq, {, 2}) H n = ICG(2pq, {p, 2p, q, 2q}). We see that G n and H n are non-cospectral graphs with equal energy 8(p )(q ), equal Laplacian energy 8(p )(q ) and equal distance energy 4(3pq 2p 2q + 2).
25 Unitary Cayley graphs Equienergetic graphs Energy modulo 4 Using a computer search on graphs with 0 vertices, we concluded that there are no pairs of A, L, and D equienergetic graphs. Let n = 2pq, where p > q > 2 are arbitrary prime numbers. Consider the following integral circulant graphs G n = ICG(2pq, {, 2}) H n = ICG(2pq, {p, 2p, q, 2q}). We see that G n and H n are non-cospectral graphs with equal energy 8(p )(q ), equal Laplacian energy 8(p )(q ) and equal distance energy 4(3pq 2p 2q + 2).
26 Unitary Cayley graphs Equienergetic graphs Energy modulo 4 Figure: A pair of triply equienergetic integral circulant graphs on 30 vertices H 30 and G 30.
27 Unitary Cayley graphs Equienergetic graphs Energy modulo 4 Characterizing the set of positive numbers which can occur as energy of a graph has been a problem of interest. Bapat proved that if the energy of a graph is rational then it must be an even integer. Here we extend this result for the integral circulant graphs Theorem For odd n the energy of ICG n (D) is divisible by four.
28 Unitary Cayley graphs Equienergetic graphs Energy modulo 4 Lemma For n 2 it holds that c(j, n) 2N + if and only if 4 n and j = p α p α k k J for some integer J such that gcd(j, n) {, 2}. Since x x (mod 2), we have E(G) 2 d D (n )/2 E(G) = λ λ i ϕ(n/d) 2 + (n )/2 i= i= c(i, n/d) (mod 2). d D
29 Unitary Cayley graphs Equienergetic graphs Energy modulo 4 After exchanging the order of the summation E(G) 2 d D ϕ(n/d) 2 + d D (n )/2 i= c(i, n/d) (mod 2). Using the largest square-free divisor of n/d we finally get E(G) 2 d D d + ϕ(n/d) (mod 2). 2 Since n is odd, d/2 D and therefore ϕ(n/d) is even for any d D.
30 Open question References Questions for the further research: It would be interesting to calculate the energy of an arbitrary integral circulant graph X n (D) Characterize the structure of divisor sets D producing integral circulant graphs with minimal/maximal energy for fixed value n Analyze other graph-theoretical properties of integral circulant graphs
31 Open question References A. Ilić, M. Bašić, I. Gutman, Triply Equienergetic Graphs, MATCH Commun. Math. Comput. Chem. 64 (200), I. Gutman, The energy of a graph: Old and new results, in: A. Betten, A. Kohnert, R. Laue, A. Wassermann (Eds.), Algebraic Combinatorics and Applications, Springer Verlag, Berlin, 200, A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 43 (2009) A. Ilić, Distance spectra and distance energy of integral circulant graphs, Linear Algebra Appl., in press. M. Bašić, M. D. Petković, D. Stevanović, Perfect state transfer in integral circulant graphs, Appl. Math. Letters 22 (2009) 7 2. W. Klotz, T. Sander, Some properties of unitary Cayley graphs, Electr. J. Comb. 4 (2007), #R45. W. So, Integral circulant graphs, Discrete Math. 306 (2006) R. B. Bapat, S. Pati, Energy of a graph is never an odd integer, Bull. Kerala Math. Assoc. (2004)
32 Open question References Thank you!
D-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 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 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 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 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 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 informationSpectral Properties of Distance Matrix of Graphs
I. Gutman, B. Furtula (Eds.), Distance in Molecular Graphs Theory, Univ. Kragujevac, Kragujevac, 01, pp. 139 176. Spectral Properties of Distance Matrix of Graphs Dragan Stevanović 1 and Aleksandar Ilić
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 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 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 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 informationThe energy of the Mycielskian of a regular graph
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 5 (1), Pages 163 171 The energy of the Mycielskian of a regular graph R. Balakrishnan Department of Mathematics Bharathidasan University Tiruchirappalli-64
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 informationSEIDEL 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 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 informationLAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS
Kragujevac Journal of Mathematics Volume 39() (015), Pages 193 05. LAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS HARISHCHANDRA S. RAMANE 1, GOURAMMA A. GUDODAGI 1,
More 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 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 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 informationTilburg University. Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: Link to publication
Tilburg University Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: 2007 Link to publication Citation for published version (APA): Haemers, W. H. (2007). Strongly Regular Graphs
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 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 informationA Note on Integral Non-Commuting Graphs
Filomat 31:3 (2017), 663 669 DOI 10.2298/FIL1703663G Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat A Note on Integral Non-Commuting
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 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 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 informationMaximum exponent of boolean circulant matrices with constant number of nonzero entries in its generating vector
Maximum exponent of boolean circulant matrices with constant number of nonzero entries in its generating vector MI Bueno, Department of Mathematics and The College of Creative Studies University of California,
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 informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 3 No., 018 pp.179-194 DOI: 10.049/CCO.018.685.109 CCO Commun. Comb. Optim. Leap Zagreb Indices of Trees and Unicyclic Graphs Zehui Shao 1, Ivan Gutman,
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 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 informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
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 informationarxiv: v1 [math.co] 27 Nov 2014
Extremal matching energy of complements of trees Tingzeng Wu a,,1, Weigen Yan b,2, Heping Zhang c,1 a School of Mathematics and Statistics, Qinghai Nationalities University, Xining, Qinghai 810007, P.
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 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 informationALGEBRAIC STRUCTURE COUNT OF ANGULAR HEXAGONAL-SQUARE CHAINS
ALGEBRAIC STRUCTURE COUNT OF ANGULAR HEXAGONAL-SQUARE CHAINS Olga Bodroža-Pantić Department of Mathematics and Informatics, Faculty of Sciences, Trg D. Obradovića 4, University of Novi Sad, 21000 Novi
More informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
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 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 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 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 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 informationPeriodicity & State Transfer Some Results Some Questions. Periodic Graphs. Chris Godsil. St John s, June 7, Chris Godsil Periodic Graphs
St John s, June 7, 2009 Outline 1 Periodicity & State Transfer 2 Some Results 3 Some Questions Unitary Operators Suppose X is a graph with adjacency matrix A. Definition We define the operator H X (t)
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 informationMilovanović Bounds for Seidel Energy of a Graph
Advances in Theoretical and Applied Mathematics. ISSN 0973-4554 Volume 10, Number 1 (2016), pp. 37 44 Research India Publications http://www.ripublication.com/atam.htm Milovanović Bounds for Seidel Energy
More informationSum and shifted-product subsets of product-sets over finite rings
Sum and shifted-product subsets of product-sets over finite rings Le Anh Vinh University of Education Vietnam National University, Hanoi vinhla@vnu.edu.vn Submitted: Jan 6, 2012; Accepted: May 25, 2012;
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 informationOn Modular Colorings of Caterpillars
On Modular Colorings of Caterpillars Futaba Okamoto Mathematics Department University of Wisconsin - La Crosse La Crosse, WI 546 Ebrahim Salehi Department of Mathematical Sciences University of Nevada
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 informationDeterminant of the distance matrix of a tree with matrix weights
Determinant of the distance matrix of a tree with matrix weights R. B. Bapat Indian Statistical Institute New Delhi, 110016, India fax: 91-11-26856779, e-mail: rbb@isid.ac.in Abstract Let T be a tree with
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 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 informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a) Find the inverse of 178 in Z 365. Solution: We find s and t so that 178s + 365t = 1, and then 178 1 = s. The Euclidean Algorithm gives 365 = 178 + 9 178
More informationarxiv: v1 [math.co] 3 May 2013
arxiv:1305.0601v1 [math.co] 3 May 2013 On the Cayley graph of a commutative ring with respect to its zero-divisors G. Aalipour a,b and S. Akbari a,b a Department of Mathematical Sciences, Sharif University
More informationObjective Type Questions
DISTANCE EDUCATION, UNIVERSITY OF CALICUT NUMBER THEORY AND LINEARALGEBRA Objective Type Questions Shyama M.P. Assistant Professor Department of Mathematics Malabar Christian College, Calicut 7/3/2014
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 informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More informationA LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH
Volume 10, Number, Pages 5 56 ISSN 1715-0868 A LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH SRINIVASA RAO KOLA AND PRATIMA PANIGRAHI Abstract Radio k-coloring is a variation of Hale s
More informationDIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH
DIRECTED CYCLIC HAMILTONIAN CYCLE SYSTEMS OF THE COMPLETE SYMMETRIC DIGRAPH HEATHER JORDON AND JOY MORRIS Abstract. In this paper, we prove that directed cyclic hamiltonian cycle systems of the complete
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 informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationHexagonal Chains with Segments of Equal Lengths Having Distinct Sizes and the Same Wiener Index
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 78 (2017) 121-132 ISSN 0340-6253 Hexagonal Chains with Segments of Equal Lengths Having Distinct Sizes and
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 informationMULTIPLICATIVE ZAGREB ECCENTRICITY INDICES OF SOME COMPOSITE GRAPHS. Communicated by Ali Reza Ashrafi. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 21-29. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir MULTIPLICATIVE ZAGREB ECCENTRICITY
More informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 1 No. 2, 2016 pp.137-148 DOI: 10.22049/CCO.2016.13574 CCO Commun. Comb. Optim. On trees and the multiplicative sum Zagreb index Mehdi Eliasi and Ali
More informationA PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY
A PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY I. HECKENBERGER AND J. SAWADA Abstract. A bound resembling Pascal s identity is presented for binary necklaces with fixed density using
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.co] 29 Jul 2010
RADIO NUMBERS FOR GENERALIZED PRISM GRAPHS PAUL MARTINEZ, JUAN ORTIZ, MAGGY TOMOVA, AND CINDY WYELS arxiv:1007.5346v1 [math.co] 29 Jul 2010 Abstract. A radio labeling is an assignment c : V (G) N such
More informationEigenvalues, random walks and Ramanujan graphs
Eigenvalues, random walks and Ramanujan graphs David Ellis 1 The Expander Mixing lemma We have seen that a bounded-degree graph is a good edge-expander if and only if if has large spectral gap If G = (V,
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 informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
More informationAverage value of the Euler function on binary palindromes
Average value of the Euler function on binary palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 652 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More informationAutomorphisms of strongly regular graphs and PDS in Abelian groups
Automorphisms of strongly regular graphs and PDS in Abelian groups Zeying Wang Department of Mathematical Sciences Michigan Technological University Joint work with Stefaan De Winter and Ellen Kamischke
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 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 informationThe Chinese Remainder Theorem
Chapter 5 The Chinese Remainder Theorem 5.1 Coprime moduli Theorem 5.1. Suppose m, n N, and gcd(m, n) = 1. Given any remainders r mod m and s mod n we can find N such that N r mod m and N s mod n. Moreover,
More informationCorollary 4.2 (Pepin s Test, 1877). Let F k = 2 2k + 1, the kth Fermat number, where k 1. Then F k is prime iff 3 F k 1
4. Primality testing 4.1. Introduction. Factorisation is concerned with the problem of developing efficient algorithms to express a given positive integer n > 1 as a product of powers of distinct primes.
More informationEuler s idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees
arxiv:110.65v [math.co] 11 Feb 01 Euler s idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees Jernej Azarija Riste Škrekovski Department of Mathematics,
More informationarxiv: v2 [math.co] 4 Sep 2009
Bounds for the Hückel energy of a graph Ebrahim Ghorbani a,b,, Jack H. Koolen c,d,, Jae Young Yang c a Department of Mathematical Sciences, Sharif University of Technology, P.O. Box 11155-9415, Tehran,
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 informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
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 information3-Class Association Schemes and Hadamard Matrices of a Certain Block Form
Europ J Combinatorics (1998) 19, 943 951 Article No ej980251 3-Class Association Schemes and Hadamard Matrices of a Certain Block Form R W GOLDBACH AND H L CLAASEN We describe 3-class association schemes
More informationIMFM Institute of Mathematics, Physics and Mechanics Jadranska 19, 1000 Ljubljana, Slovenia. Preprint series Vol. 49 (2011), 1157 ISSN
IMFM Institute of Mathematics, Physics and Mechanics Jadranska 19, 1000 Ljubljana, Slovenia Preprint series Vol. 9 (011), 1157 ISSN -09 EULER S IDONEAL NUMBERS AND AN INEQUALITY CONCERNING MINIMAL GRAPHS
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 informationChapter 1. Number of special form. 1.1 Introduction(Marin Mersenne) 1.2 The perfect number. See the book.
Chapter 1 Number of special form 1.1 Introduction(Marin Mersenne) See the book. 1.2 The perfect number Definition 1.2.1. A positive integer n is said to be perfect if n is equal to the sum of all its positive
More informationExercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.
Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)
More informationSelf-complementary circulant graphs
Self-complementary circulant graphs Brian Alspach Joy Morris Department of Mathematics and Statistics Burnaby, British Columbia Canada V5A 1S6 V. Vilfred Department of Mathematics St. Jude s College Thoothoor
More informationA Series of Regular Hadamard Matrices
A Series of Regular Hadamard Matrices Dean Crnković Abstract Let p and p 1 be prime powers and p 3 (mod 4). Then there exists a symmetric design with parameters (4p,p p,p p). Thus there exists a regular
More informationNILPOTENT NUMBERS JONATHAN PAKIANATHAN AND KRISHNAN SHANKAR
NILPOTENT NUMBERS JONATHAN PAKIANATHAN AND KRISHNAN SHANKAR Introduction. One of the first things we learn in abstract algebra is the notion of a cyclic group. For every positive integer n, we have Z n,
More informationarxiv: v1 [math.co] 26 Sep 2017
SPECTRAL RADIUS OF A STAR WITH ONE LONG ARM arxiv:170908871v1 [mathco] 26 Sep 2017 HYUNSHIK SHIN Abstract A tree is said to be starlike if exactly one vertex has degree greater than two In this paper,
More information. Here the flats of H(2d 1, q 2 ) consist of all nonzero totally isotropic
NEW BOUNDS FOR PARTIAL SPREADS OF H(d 1, ) AND PARTIAL OVOIDS OF THE REE-TITS OCTAGON FERDINAND IHRINGER, PETER SIN, QING XIANG ( ) Abstract Our first result is that the size of a partial spread of H(,
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 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 informationMultilevel Distance Labelings for Paths and Cycles
Multilevel Distance Labelings for Paths and Cycles Daphne Der-Fen Liu Department of Mathematics California State University, Los Angeles Los Angeles, CA 90032, USA Email: dliu@calstatela.edu Xuding Zhu
More informationarxiv: v4 [math.gr] 17 Jun 2015
On finite groups all of whose cubic Cayley graphs are integral arxiv:1409.4939v4 [math.gr] 17 Jun 2015 Xuanlong Ma and Kaishun Wang Sch. Math. Sci. & Lab. Math. Com. Sys., Beijing Normal University, 100875,
More informationDistance spectral radius of trees with fixed maximum degree
Electronic Journal of Linear Algebra Volume 20 Volume 20 (200) Article 3 200 Distance spectral radius of trees with fixed maximum degree Dragan Stevanovic Aleksandar Ilic aleksandari@gmail.com Follow this
More informationJeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA
#A33 INTEGERS 10 (2010), 379-392 DISTANCE GRAPHS FROM P -ADIC NORMS Jeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA 30118 jkang@westga.edu Hiren Maharaj Department
More information