Line Graphs Eigenvalues and Root Systems
|
|
- Georgia Murphy
- 5 years ago
- Views:
Transcription
1 Line Graphs Eigenvalues and Root Systems Thomas Zaslavsky Binghamton University (State University of New York) C R Rao Advanced Institute of Mathematics, Statistics and Computer Science 2 August 2010 Outline 1. What is a Line Graph? 2. What is an Eigenvalue? 3. What is a Root System? 4. What is a Signed Graph? 5. What is the Line Graph of a Signed Graph? 6. What Does It All Mean? 7. What Are Those Line Graphs of Signed Graphs?
2 2 Line Graphs, Eigenvalues, and Root Systems 2 August What is a Line Graph? Graph Γ = (V, E): Simple (no loops or multiple edges). V = v 1, v 2,..., v n }, E = e 1, e 2,..., e m }. Line graph L(Γ): V L := E(Γ), and e k e l E L e k, e l are adjacent in Γ. Adjacency matrix: 1 if v i, v j are adjacent, A(Γ) := (a ij ) i,j n with a ij = 0 if not, 0 if i = j. Unoriented incidence matrix: H( Γ) = (η ik ( Γ)) i n,k m where η ik ( Γ) = Oriented incidence matrix: H(+Γ) = (η ik (+Γ)) i n,k m where η ik (+Γ) = 1 if v i, e k are incident, 0 if not. ±1 if v i, e k are incident, 0 if not, in such a way that there are one +1 and one 1 in each column. Kirchhoff ( Laplacian ) matrix of Γ: K(+Γ) := H(+Γ)H(+Γ) T = D(Γ) A(Γ), K( Γ) := H( Γ)H( Γ) T = D(Γ) + A(Γ), where D(Γ) := diag(d(v i )) i is the degree matrix of Γ. Theorem 1.1. H( Γ) T H( Γ) = 2I + A(L(Γ)).
3 Line Graphs, Eigenvalues, and Root Systems 2 August What is an Eigenvalue? Eigenvalue of Γ: An eigenvalue of the adjacency matrix, A(Γ). Stage 1 of the History of Eigenvalues 2. Corollary 2.1. All eigenvalues of L(Σ) are 2. Thus began the hunt for graphs whose eigenvalues are 2. Hope: They are line graphs and no others. Hope is disappointed. Stage 2 of the History of Eigenvalues 2. Generalized line graph L(Γ; r 1,..., r n ): The vertex star E(v i ) := e k : e k is incident with v i } vertex clique in L. A cocktail party graph CP r := K 2r \ M r (a perfect matching). Alan Hoffman: L(Γ; r 1,..., r n ) := L(Γ) with CP ri joined to the vertex clique of v i. (Joined means use every possible edge.) Theorem 2.2. All eigenvalues of L(Γ; r 1,..., r n ) are 2. A mystery! Stage 3 of the History of Eigenvalues 2. Solution by Cameron, Goethals, Seidel, & Shult:
4 4 Line Graphs, Eigenvalues, and Root Systems 2 August What is a Root System? Root system: A finite set R R d such that RS1. x R = x R (central symmetry), RS2. x, y R = 2 x y x x Z (integrality), RS3. x, y R = y 2 x y x x x R (reflection in y ), RS4. 0 / R. Observation: ( R 1 0} ) ( ) 0} R 2 R d 1 R d 2 reducible. is a root system, called Origin: Classification of simple, finite-dimensional Lie groups and algebras by classifying irreducible root systems. The classification: and E 6, E 7, E 8, where A n 1 = x R n : x = ±(b j b i ) for i < j}, D n = An 1 x R n : x = ±(b j + b i ) for i < j}, B n = Dn b i : i n}, C n = Dn 2b i : i n}, E 6 E 7 E 8 = Dn 1 2 (±b 1 ± ± b 8 ) : evenly many signs are }. Theorem 3.1 (Cameron, Goethals, Seidel, and Shult). Any graph with eigenvalues 2 is negatively represented by the angles of a subset of a root system D r for some r Z, or E 8. Negative angle representation of Γ: ψ : V R d such that ψ(v i ) ψ(v j ) = (The factor 2 is merely a normalization.) 2a ij if i j, 2 if i = j.
5 Line Graphs, Eigenvalues, and Root Systems 2 August What is a Signed Graph? Signed graph: Σ = (Γ, σ) where σ : E +, }. Examples: +Γ = Γ with all edges positive. Γ = Γ with all edges negative. ± = with all edges both positive and negative (2 edges for each original edge). Underlying graph: Σ := Γ. Positive and negative circles: Product of the edge signs. Adjacency matrix: 1 if v i, v j are positively adjacent, 1 if v i, v j are negatively adjacent, A(Σ) := (a ij ) i,j n with a ij = 0 if not adjacent, 0 if i = j. Reduced signed graph Σ: Delete every pair of parallel edges with opposite sign. No effect on A(Σ). Incidence matrix: H(Σ) = (η ik ) i n,k m where η ik = ±1 if v i, e k are incident, 0 if not, in such a way that the the two nonzero elements of the column of e k satisfy η ik η jk = σ(e k ). Kirchhoff ( Laplacian ) matrix of Σ: K(Σ) := H(Σ)H(Σ) T = D(Σ) A(Σ) where D(Σ) := diag(d(v i )) i is the degree matrix of the underlying graph of Σ.
6 6 Line Graphs, Eigenvalues, and Root Systems 2 August What is the Line Graph of a Signed Graph? Oriented signed graph: (Σ, η) where η : V E +, } 0} satisfies η(v i, e k )η(v j, e k ) = σ(e k ) if e k :v i v j, η(v i, e k ) = 0 if v i and e k are not incident. Meaning: + denotes an arrow pointing into the vertex. denotes an arrow pointing out of the vertex. Bidirected graph B: Every end of every edge has an independent arrow, or, B = (Γ, η). (Due to Edmonds.) An oriented signed graph is a bidirected graph. A bidirected graph is an oriented signed graph. (Due to Zaslavsky.) Line graph of Σ: Λ(Σ) = (L( Σ ), η Λ ) where η Λ (e k, e k e l ) = η(v i, e k ) and v i is the vertex common to e k and e l. That is: (1) Orient Σ (arbitrarily). (2) Construct L( Σ ). (3) Treat each edge end in L as the end in Σ with the arrow turned around so it remains into, or out of, the vertex. Proposition 5.1. The circle signs in Λ(Σ) are independent of the arbitrary orientation. Reduced line graph: Λ(Σ). Theorem 5.2. H(Σ) T H(Σ) = 2I A(Λ(Σ)) = 2I A( Λ(Σ)). Corollary 5.3. All eigenvalues of Λ(Γ), or Λ(Γ), are 2.
7 Line Graphs, Eigenvalues, and Root Systems 2 August First Answer:: 6. What Does It All Mean? Theorem 6.1 (Cameron, Goethals, Seidel, and Shult, reinterpreted). Any signed graph with eigenvalues 2 is represented by the angles of a subset of a root system D r for some r Z, or E 8. Angle representation of Σ: ψ : V R d such that ψ(v i ) ψ(v j ) = (The factor 2 is merely a normalization.) 2a ij if i j, 2 if i = j. Second Answer:: Theorem 6.2. A signed graph with eigenvalues 2 is either the line graph of a signed graph, or one of the finitely many signed graphs with an angle representation in E 8. Those generalized line graphs are line graphs. Σ(r 1,..., r n ) := Σ with r i negative digons attached to v i. Proposition 6.3. L(Γ; r 1,..., r n ) = Λ( Γ(r 1,..., r n )). Mantra: The proper context for line graphs is signed graphs.
8 8 Line Graphs, Eigenvalues, and Root Systems 2 August What Are Those Line Graphs of Signed Graphs? Theorem 7.1 (Chawathe & G.R. Vijayakumar). The signed graphs represented by angles in D n for some n are those in which no induced subgraph is one of a certain finite list of signed graphs of order up to 6. Theorem 7.2 (G.R. Vijayakumar). The signed graphs represented by angles in E 8 are those in which no induced subgraph is one of a certain finite list of signed graphs of order up to 10. What graphs are (reduced) line graphs of signed graphs? (1) The reduced line graphs that are all negative are for = generalized line graph. Eigenvalues of are 2; of are 2. Forbidden induced subgraphs (S.B. Rao, Singhi, and Vijayan, without signed graphs). (2) The reduced line graphs that are all positive, +, are much fewer and less interesting. Eigenvalues of + are 2.
9 Line Graphs, Eigenvalues, and Root Systems 2 August References [1] P.J. Cameron, J.M. Goethals, J.J. Seidel, and E.E. Shult, Line graphs, root systems, and elliptic geometry. J. Algebra 43 (1976), MR 56 #182. Zbl [2] P.D. Chawathe and G.R. Vijayakumar, A characterization of signed graphs represented by root system D. European J. Combin. 11 (1990), MR 91k: Zbl [3] F. Harary, On the notion of balance of a signed graph. Michigan Math. J. 2 ( ), and addendum preceding p. 1. MR 16, 733h. Zbl [4] S.B. Rao, N.M. Singhi, and K.S. Vijayan, The minimal forbidden subgraphs for generalized line graphs. In: S.B. Rao, ed., Combinatorics and Graph Theory (Proc. Sympos., Calcutta, 1980), pp Lecture Notes in Math., 885. Springer-Verlag, Berlin, MR 83i: Zbl [5] N.M. Singhi and G.R. Vijayakumar, Signed graphs with least eigenvalue < 2. European J. Combin. 13 (1992), MR 93e: Zbl [6] G.R. Vijayakumar, Signed graphs represented by D. European J. Combin. 8 (1987), MR 88b: Zbl And see other relevant papers in [12]. [7] G.R. Vijayakumar, Signed graphs represented by root system E 8. Sankhya Ser. A 54 (1992), MR 94d: Zbl [8] Thomas Zaslavsky, Signed graphs. Discrete Appl. Math. 4 (1982), Erratum. Discrete Appl. Math. 5 (1983), 248. MR 84e: Zbl The theory of the incidence matrix. [9] Thomas Zaslavsky, Orientation of signed graphs. European J. Combin. 12 (1991), MR 93a: Zbl [10] Thomas Zaslavsky, Line graphs of signed graphs and digraphs. In preparation. [11] Thomas Zaslavsky, Graphs, Gain Graphs, and Geometry: a.k.a. Signed Graphs and their Friends, Course notes for Math 581: Topics in Graph Theory: Graphs and Geometry, Binghamton University (SUNY), Fall, 2008 Spring Summer, 2009 Spring, In preparation; URL See Section II.M for line graphs of signed graphs. [12] Thomas Zaslavsky, A mathematical bibliography of signed and gain graphs and allied areas. Electronic J. Combin., Dynamic Surveys in Combinatorics (1998), No. DS8 (electronic). MR 2000m:05001a. Zbl Current working update at URL
Matrices in the Theory of Signed Simple Graphs
Matrices in the Theory of Signed Simple Graphs Thomas Zaslavsky Department of Mathematical Sciences Binghamton University (SUNY) Binghamton, NY 13902-6000, U.S.A. E-mail zaslav@math.binghamton.edu September
More informationNon-Attacking Chess Pieces: The Bishop
Non-Attacking Chess Pieces: The Bishop Thomas Zaslavsky Binghamton University (State University of New York) C R Rao Advanced Institute of Mathematics, Statistics and Computer Science 9 July 010 Joint
More informationOn fat Hoffman graphs with smallest eigenvalue at least 3
On fat Hoffman graphs with smallest eigenvalue at least 3 Qianqian Yang University of Science and Technology of China Ninth Shanghai Conference on Combinatorics Shanghai Jiaotong University May 24-28,
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 informationReference Notes for Lectures on Signed Graphs and Geometry. Thomas Zaslavsky
Reference Notes for Lectures on Signed Graphs and Geometry by Thomas Zaslavsky Workshop on Signed Graphs, Set-Valuations and Geometry CMS Pala Campus, Pala, and Mary Matha Arts and Science College, Manathavady,
More informationOn graphs with smallest eigenvalue at least 3 and their lattices
On graphs with smallest eigenvalue at least 3 and their lattices arxiv:1804.00369v1 [math.co] 2 Apr 2018 e-mail: Jack H. Koolen, Jae Young Yang, Qianqian Yang School of Mathematical Sciences, University
More informationSiddaganga Institute of Technology B.H. Road, Tumkur , Karnataka, INDIA 2,3 Department of Mathematics
International Journal of Pure and Applied Mathematics Volume 98 No. 2 2015, 231-238 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v98i2.6
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
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 informationNote on the normalized Laplacian eigenvalues of signed graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 44 (2009), Pages 153 162 Note on the normalized Laplacian eigenvalues of signed graphs Hong-hai Li College of Mathematic and Information Science Jiangxi Normal
More informationApplying block intersection polynomials to study graphs and designs
Applying block intersection polynomials to study graphs and designs Leonard Soicher Queen Mary University of London CoCoA15, Colorado State University, Fort Collins, July 2015 Leonard Soicher (QMUL) Block
More informationExtension of Strongly Regular Graphs
Extension of Strongly Regular Graphs Ralucca Gera Department of Applied Mathematics Naval Postgraduate School, Monterey, CA 93943 email: rgera@nps.edu, phone (831) 656-2206, fax (831) 656-2355 and Jian
More informationThe Matrix-Tree Theorem
The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries
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 informationA linear algebraic view of partition regular matrices
A linear algebraic view of partition regular matrices Leslie Hogben Jillian McLeod June 7, 3 4 5 6 7 8 9 Abstract Rado showed that a rational matrix is partition regular over N if and only if it satisfies
More informationCharacteristic flows on signed graphs and short circuit covers
Characteristic flows on signed graphs and short circuit covers Edita Máčajová Martin Škoviera Department of Computer Science Faculty of Mathematics, Physics and Informatics Comenius University 842 48 Bratislava,
More informationAn Introduction to Spectral Graph Theory
An Introduction to Spectral Graph Theory Mackenzie Wheeler Supervisor: Dr. Gary MacGillivray University of Victoria WheelerM@uvic.ca Outline Outline 1. How many walks are there from vertices v i to v j
More informationarxiv: v1 [math.co] 13 May 2016
GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in
More informationMax-Planck-Institut für Mathematik in den Naturwissenschaften Leipzig
Max-Planck-Institut für Mathematik in den Naturwissenschaften Leipzig On the spectrum of the normalized Laplacian for signed graphs: Interlacing, contraction, and replication by Fatihcan M. Atay and Hande
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 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 informationFundamental Dominations in Graphs
Fundamental Dominations in Graphs arxiv:0808.4022v1 [math.co] 29 Aug 2008 Arash Behzad University of California, LosAngeles abehzad@ee.ucla.edu Mehdi Behzad Shahid Beheshti University, Iran mbehzad@sharif.edu
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 informationHermitian adjacency matrix of digraphs
of digraphs Krystal Guo Bojan Mohar Department of Combinatorics & Optimization Univeristy of Waterloo Systems of Lines: Applications of Algebraic Combinatorics, August 12, 2015 K. Guo
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationIntersection graphs of oriented hypergraphs and their matrices
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 65(1) (2016), Pages 108 123 Intersection graphs of oriented hypergraphs and their matrices Nathan Reff Department of Mathematics The College at Brockport: State
More informationarxiv: v1 [math.co] 18 Jan 2019
Edge intersection hypergraphs a new hypergraph concept Martin Sonntag 1, Hanns-Martin Teichert 2 arxiv:1901.06292v1 [math.co] 18 Jan 2019 1 Faculty of Mathematics and Computer Science, Technische Universität
More informationHamilton cycles in bidirected complete graphs
Hamilton cycles in bidirected complete graphs Arthur Busch, Mohammed A. Mutar, and Daniel Slilaty January 2, 2019 Abstract Zaslavsky observed that the topics of directed cycles in directed graphs and alternating
More informationNegative Circles in Signed Graphs: A Problem Collection
arxiv:1610.04690v1 [math.co] 15 Oct 2016 Abstract Negative Circles in Signed Graphs: A Problem Collection Thomas Zaslavsky 1 Department of Mathematical Sciences Binghamton University (State University
More informationHecke Operators, Zeta Functions and the Satake map
Hecke Operators, Zeta Functions and the Satake map Thomas R. Shemanske December 19, 2003 Abstract Taking advantage of the Satake isomorphism, we define (n + 1) families of Hecke operators t n k (pl ) for
More informationRoot systems and optimal block designs
Root systems and optimal block designs Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, UK p.j.cameron@qmul.ac.uk Abstract Motivated by a question
More informationarxiv: v2 [math.co] 24 Mar 2011
The non-bipartite integral graphs with spectral radius three TAEYOUNG CHUNG E-mail address: tae7837@postech.ac.kr JACK KOOLEN arxiv:1011.6133v2 [math.co] 24 Mar 2011 Department of Mathematics, POSTECH,
More informationDouble domination in signed graphs
PURE MATHEMATICS RESEARCH ARTICLE Double domination in signed graphs P.K. Ashraf 1 * and K.A. Germina 2 Received: 06 March 2016 Accepted: 21 April 2016 Published: 25 July 2016 *Corresponding author: P.K.
More informationarxiv: v1 [math.co] 6 Jan 2017
Domination in intersecting hypergraphs arxiv:70.0564v [math.co] 6 Jan 207 Yanxia Dong, Erfang Shan,2, Shan Li, Liying Kang Department of Mathematics, Shanghai University, Shanghai 200444, P.R. China 2
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 informationNote on p-competition Graphs and Paths
Southeast Asian Bulletin of Mathematics (2018) 42: 575 584 Southeast Asian Bulletin of Mathematics c SEAMS. 2018 Note on p-competition Graphs and Paths Y. Kidokoro, K. Ogawa, S. Tagusari, M. Tsuchiya Department
More informationSemifull Line (Block) Signed Graphs
International J.Math. Combin. Vol.2(2018), 80-86 Semifull Line (Block) Signed Graphs V. Lokesha 1, P. S. Hemavathi 1,2 and S. Vijay 3 1. Department of Studies in Mathematics, Vijayanagara Sri Krishnadevaraya
More informationCombinatorial and physical content of Kirchhoff polynomials
Combinatorial and physical content of Kirchhoff polynomials Karen Yeats May 19, 2009 Spanning trees Let G be a connected graph, potentially with multiple edges and loops in the sense of a graph theorist.
More informationCLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES
Bull Korean Math Soc 45 (2008), No 1, pp 95 99 CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES In-Jae Kim and Bryan L Shader Reprinted
More informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationarxiv: v2 [math.co] 15 Feb 2014
On the determinant of hexagonal grids H k,n Anna Bień 1 Institute of Mathematics, University of Silesia, Katowice, Poland arxiv:1309.0087v [math.co] 15 Feb 014 Abstract We analyse the problem of singularity
More informationarxiv: v1 [math.gr] 7 Jan 2019
The ranks of alternating string C-groups Mark Mixer arxiv:1901.01646v1 [math.gr] 7 Jan 019 January 8, 019 Abstract In this paper, string C-groups of all ranks 3 r < n are provided for each alternating
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 informationMath 5707: Graph Theory, Spring 2017 Midterm 3
University of Minnesota Math 5707: Graph Theory, Spring 2017 Midterm 3 Nicholas Rancourt (edited by Darij Grinberg) December 25, 2017 1 Exercise 1 1.1 Problem Let G be a connected multigraph. Let x, y,
More informationNowhere-zero flows in signed series-parallel graphs arxiv: v1 [math.co] 6 Nov 2014
Nowhere-zero flows in signed series-parallel graphs arxiv:1411.1788v1 [math.co] 6 Nov 2014 Tomáš Kaiser 1,2 Edita Rollová 1,3 Abstract Bouchet conjectured in 1983 that each signed graph that admits a nowhere-zero
More informationMatching Index of Uncertain Graph: Concept and Algorithm
Matching Index of Uncertain Graph: Concept and Algorithm Bo Zhang, Jin Peng 2, School of Mathematics and Statistics, Huazhong Normal University Hubei 430079, China 2 Institute of Uncertain Systems, Huanggang
More information4 Packing T-joins and T-cuts
4 Packing T-joins and T-cuts Introduction Graft: A graft consists of a connected graph G = (V, E) with a distinguished subset T V where T is even. T-cut: A T -cut of G is an edge-cut C which separates
More informationLecture 4. Random graphs II. 4.1 Automorphisms. 4.2 The number of simple graphs
Lecture 4 Random graphs II 4.1 Automorphisms It turns out that a typical regular graph on a large number of vertices does not have any non-trivial symmetries. This is orginally due to Bollobás [Bol82]
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 informationEuropean Journal of Combinatorics. Locally subquadrangular hyperplanes in symplectic and Hermitian dual polar spaces
European Journal of Combinatorics 31 (2010) 1586 1593 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Locally subquadrangular hyperplanes
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 informationNetworks and Matrices
Bowen-Lanford Zeta function, Math table talk Oliver Knill, 10/18/2016 Networks and Matrices Assume you have three friends who do not know each other. This defines a network containing 4 nodes in which
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 informationZero-Divisor Graph with Respect to an Ideal *
Zero-Divisor Graph with Respect to an Ideal * H. R. Maimani, M. R. Pournaki, S. Yassemi Abstract Let R be a commutative ring with nonzero identity and let I be an ideal of R. The zero-divisor graph of
More informationBicyclic digraphs with extremal skew energy
Electronic Journal of Linear Algebra Volume 3 Volume 3 (01) Article 01 Bicyclic digraphs with extremal skew energy Xiaoling Shen Yoaping Hou yphou@hunnu.edu.cn Chongyan Zhang Follow this and additional
More informationALGEBRAIC PROPERTIES OF BIER SPHERES
LE MATEMATICHE Vol. LXVII (2012 Fasc. I, pp. 91 101 doi: 10.4418/2012.67.1.9 ALGEBRAIC PROPERTIES OF BIER SPHERES INGA HEUDTLASS - LUKAS KATTHÄN We give a classification of flag Bier spheres, as well as
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
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 informationZero controllability in discrete-time structured systems
1 Zero controllability in discrete-time structured systems Jacob van der Woude arxiv:173.8394v1 [math.oc] 24 Mar 217 Abstract In this paper we consider complex dynamical networks modeled by means of state
More informationUNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS
UNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS MARIA CHUDNOVSKY, RINGI KIM, SANG-IL OUM, AND PAUL SEYMOUR Abstract. An n-vertex graph is prime if it has no homogeneous set, that
More informationThe super line graph L 2
Discrete Mathematics 206 (1999) 51 61 www.elsevier.com/locate/disc The super line graph L 2 Jay S. Bagga a;, Lowell W. Beineke b, Badri N. Varma c a Department of Computer Science, College of Science and
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 informationIntegral trees of odd diameters
Integral trees of odd diameters E. Ghorbani A. Mohammadian B. Tayfeh-Rezaie arxiv:1011.4666v1 [math.co] 21 Nov 2010 School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box
More informationEigenvalues and edge-connectivity of regular graphs
Eigenvalues and edge-connectivity of regular graphs Sebastian M. Cioabă University of Delaware Department of Mathematical Sciences Newark DE 19716, USA cioaba@math.udel.edu August 3, 009 Abstract In this
More informationORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS
ORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS SIMON M. SMITH Abstract. If G is a group acting on a set Ω and α, β Ω, the digraph whose vertex set is Ω and whose arc set is the orbit (α, β)
More informationALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER. Włodzimierz Ulatowski
Opuscula Math. 33, no. 4 (2013), 763 783 http://dx.doi.org/10.7494/opmath.2013.33.4.763 Opuscula Mathematica ALL GRAPHS WITH PAIRED-DOMINATION NUMBER TWO LESS THAN THEIR ORDER Włodzimierz Ulatowski Communicated
More informationOn the stable set of associated prime ideals of monomial ideals and square-free monomial ideals
On the stable set of associated prime ideals of monomial ideals and square-free monomial ideals Kazem Khashyarmanesh and Mehrdad Nasernejad The 10th Seminar on Commutative Algebra and Related Topics, 18-19
More informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More informationHAMILTONICITY AND FORBIDDEN SUBGRAPHS IN 4-CONNECTED GRAPHS
HAMILTONICITY AND FORBIDDEN SUBGRAPHS IN 4-CONNECTED GRAPHS FLORIAN PFENDER Abstract. Let T be the line graph of the unique tree F on 8 vertices with degree sequence (3, 3, 3,,,,, ), i.e. T is a chain
More informationIntriguing sets of vertices of regular graphs
Intriguing sets of vertices of regular graphs Bart De Bruyn and Hiroshi Suzuki February 18, 2010 Abstract Intriguing and tight sets of vertices of point-line geometries have recently been studied in the
More informationThe Singular Acyclic Matrices of Even Order with a P-Set of Maximum Size
Filomat 30:13 (016), 3403 3409 DOI 1098/FIL1613403D Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat The Singular Acyclic Matrices of
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 informationBOUNDS ON THE FIBONACCI NUMBER OF A MAXIMAL OUTERPLANAR GRAPH
BOUNDS ON THE FIBONACCI NUMBER OF A MAXIMAL OUTERPLANAR GRAPH Ahmad Fawzi Alameddine Dept. of Math. Sci., King Fahd University of Petroleum and Minerals, Dhahran 11, Saudi Arabia (Submitted August 1) 1.
More informationON GLOBAL DOMINATING-χ-COLORING OF GRAPHS
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
More informationSpectral characterization of Signed Graphs
University of Primorska, Koper May 2015 Signed Graphs Basic notions on Signed Graphs Matrices of Signed Graphs A signed graph Γ is an ordered pair (G, σ), where G = (V (G), E(G)) is a graph and σ : E(G)
More informationGENERALIZED PIGEONHOLE PROPERTIES OF GRAPHS AND ORIENTED GRAPHS
GENERALIZED PIGEONHOLE PROPERTIES OF GRAPHS AND ORIENTED GRAPHS ANTHONY BONATO, PETER CAMERON, DEJAN DELIĆ, AND STÉPHAN THOMASSÉ ABSTRACT. A relational structure A satisfies the n k property if whenever
More informationSome results on the reduced power graph of a group
Some results on the reduced power graph of a group R. Rajkumar and T. Anitha arxiv:1804.00728v1 [math.gr] 2 Apr 2018 Department of Mathematics, The Gandhigram Rural Institute-Deemed to be University, Gandhigram
More information38 PETROVIĆ AND MILEKIĆ In this paper we also determine all minimal generalized line graphs with the property 2 (G) > 1. There are exactly 21 such gra
PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE Nouvelle série, tome 68(82) (2000), 37 45 GENERALIZED LINE GRAPHS WITH THE SECOND LARGEST EIGENVALUE AT MOST 1 Miroslav Petrović and Bojana Milekić Communicated
More informationBase subsets of polar Grassmannians
Journal of Combinatorial Theory, Series A 114 (2007) 1394 1406 www.elsevier.com/locate/jcta Base subsets of polar Grassmannians Mark Pankov Department of Mathematics and Information Technology, University
More informationAn algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 2 (207) 205 27 An algebraic proof of the Erdős-Ko-Rado theorem for intersecting
More informationGraph homomorphisms. Peter J. Cameron. Combinatorics Study Group Notes, September 2006
Graph homomorphisms Peter J. Cameron Combinatorics Study Group Notes, September 2006 Abstract This is a brief introduction to graph homomorphisms, hopefully a prelude to a study of the paper [1]. 1 Homomorphisms
More informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationDEGREE SEQUENCES OF INFINITE GRAPHS
DEGREE SEQUENCES OF INFINITE GRAPHS ANDREAS BLASS AND FRANK HARARY ABSTRACT The degree sequences of finite graphs, finite connected graphs, finite trees and finite forests have all been characterized.
More informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More informationON COST MATRICES WITH TWO AND THREE DISTINCT VALUES OF HAMILTONIAN PATHS AND CYCLES
ON COST MATRICES WITH TWO AND THREE DISTINCT VALUES OF HAMILTONIAN PATHS AND CYCLES SANTOSH N. KABADI AND ABRAHAM P. PUNNEN Abstract. Polynomially testable characterization of cost matrices associated
More informationarxiv: v1 [math.co] 5 Nov 2016
On bipartite mixed graphs C. Dalfó a, M. A. Fiol b, N. López c arxiv:1611.01618v1 [math.co] 5 Nov 2016 a,b Dep. de Matemàtiques, Universitat Politècnica de Catalunya b Barcelona Graduate School of Mathematics
More informationMy favorite application using eigenvalues: Eigenvalues and the Graham-Pollak Theorem
My favorite application using eigenvalues: Eigenvalues and the Graham-Pollak Theorem Michael Tait Winter 2013 Abstract The famous Graham-Pollak Theorem states that one needs at least n 1 complete bipartite
More informationCounting the average size of Markov graphs
JOURNAL OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4866, ISSN (o) 2303-4947 www.imvibl.org /JOURNALS / JOURNAL Vol. 7(207), -6 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA
More informationSergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada. and
NON-PLANAR EXTENSIONS OF SUBDIVISIONS OF PLANAR GRAPHS Sergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada and Robin Thomas 1 School of Mathematics
More informationNEW CLASSES OF SET-THEORETIC COMPLETE INTERSECTION MONOMIAL IDEALS
NEW CLASSES OF SET-THEORETIC COMPLETE INTERSECTION MONOMIAL IDEALS M. R. POURNAKI, S. A. SEYED FAKHARI, AND S. YASSEMI Abstract. Let be a simplicial complex and χ be an s-coloring of. Biermann and Van
More informationELA
THE DISTANCE MATRIX OF A BIDIRECTED TREE R. B. BAPAT, A. K. LAL, AND SUKANTA PATI Abstract. A bidirected tree is a tree in which each edge is replaced by two arcs in either direction. Formulas are obtained
More informationRegular factors of regular graphs from eigenvalues
Regular factors of regular graphs from eigenvalues Hongliang Lu Center for Combinatorics, LPMC Nankai University, Tianjin, China Abstract Let m and r be two integers. Let G be a connected r-regular graph
More informationPRODUCT DISTANCE MATRIX OF A GRAPH AND SQUARED DISTANCE MATRIX OF A TREE. R. B. Bapat and S. Sivasubramanian
PRODUCT DISTANCE MATRIX OF A GRAPH AND SQUARED DISTANCE MATRIX OF A TREE R B Bapat and S Sivasubramanian Let G be a strongly connected, weighted directed graph We define a product distance η(i, j) for
More informationDistance-regular graphs where the distance-d graph has fewer distinct eigenvalues
NOTICE: this is the author s version of a work that was accepted for publication in . Changes resulting from the publishing process, such as peer review, editing, corrections,
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationAn Ore-type Condition for Cyclability
Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Ore-type Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG
More informationA Class of Vertex Transitive Graphs
Volume 119 No. 16 2018, 3137-3144 ISSN: 1314-3395 (on-line version) url: http://www.acadpubl.eu/hub/ http://www.acadpubl.eu/hub/ A Class of Vertex Transitive Graphs 1 N. Murugesan, 2 R. Anitha 1 Assistant
More informationDETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH
DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH CHRISTOPHER R.H. HANUSA AND THOMAS ZASLAVSKY Abstract. We investigate the least common multiple of all subdeterminants,
More informationOn a Conjecture of Thomassen
On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,
More informationProperties of θ-super positive graphs
Properties of θ-super positive graphs Cheng Yeaw Ku Department of Mathematics, National University of Singapore, Singapore 117543 matkcy@nus.edu.sg Kok Bin Wong Institute of Mathematical Sciences, University
More information