On the Polynomial of a Graph
From MaRDI portal
Publication:3850554
DOI10.2307/2312780zbMath0112.14901OpenAlexW4249563532MaRDI QIDQ3850554
Publication date: 1963
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2312780
Related Items (91)
A survey of some problems in combinatorial designs - a matrix approach ⋮ Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs ⋮ Entropy and the complexity of graphs: III. Graphs with prescribed information content ⋮ Hypercubes are determined by their distance spectra ⋮ On outindependent subgraphs of strongly regular graphs ⋮ A spectral characterization of the \(s\)-clique extension of the square grid graphs ⋮ On graphs with given main eigenvalues ⋮ Regular graphs with four eigenvalues ⋮ Unnamed Item ⋮ Characterizing distance-regularity of graphs by the spectrum ⋮ 5-chromatic strongly regular graphs ⋮ A characterization of distance-regular graphs with diameter three ⋮ Representation of cyclotomic fields and their subfields ⋮ From local adjacency polynomials to locally pseudo-distance-regular graphs ⋮ Distance-regularity and the spectrum of graphs ⋮ On the Line Graph of a Symmetric Balanced Incomplete Block Design ⋮ Boundary graphs. II: The limit case of a spectral property ⋮ Characterizing \((\ell ,m)\)-walk-regular graphs ⋮ Edge-distance-regular graphs are distance-regular ⋮ Spectral properties of the eccentricity matrix of graphs ⋮ On some approaches to the spectral excess theorem for nonregular graphs ⋮ The spectral excess theorem for distance-biregular graphs. ⋮ On the adjacency algebras of near hexagons with an order ⋮ Uniqueness of the rank polynomials of point stable designs ⋮ A characterization and an application of weight-regular partitions of graphs ⋮ On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes ⋮ Graphs cospectral with distance-regular graphs ⋮ Largest regular multigraphs with three distinct eigenvalues ⋮ Quotient-polynomial graphs ⋮ Multiplicative designs II. Uniform normal and related structures ⋮ Linear programming bounds for regular graphs ⋮ Graph isomorphism: physical resources, optimization models, and algebraic characterizations ⋮ A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number ⋮ On almost distance-regular graphs ⋮ A spectral excess theorem for nonregular graphs ⋮ Which graphs are determined by their spectrum? ⋮ Dual concepts of almost distance-regularity and the spectral excess theorem ⋮ On symmetric association schemes and associated quotient-polynomial graphs ⋮ On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship ⋮ Directed strongly regular graphs obtained from coherent algebras ⋮ Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\) ⋮ A characterization of bipartite distance-regular graphs ⋮ The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues ⋮ Some results on covers of complete graphs ⋮ A surprising property of the least eigenvalue of a graph ⋮ Hoffman-type identities ⋮ The symbiotic relationship of combinatorics and matrix theory ⋮ Q-integral graphs with edge-degrees at most five ⋮ Two characterizations of the grid graphs ⋮ An application of Hoffman graphs for spectral characterizations of graphs ⋮ The Polynomial of a Directed Graph ⋮ Spectral characterization of the Hamming graphs ⋮ On the Line Graph of a Projective Plane ⋮ The Laplacian spectral excess theorem for distance-regular graphs ⋮ A simple proof of the spectral excess theorem for distance-regular graphs ⋮ Some spectral and quasi-spectral characterizations of distance-regular graphs ⋮ Algebraic characterizations of graph regularity conditions ⋮ On a characterization of irreducibility of a non-negative matrix ⋮ Two spectral characterizations of regular, bipartite graphs with five eigenvalues ⋮ Eigenvalues of a graph and its imbeddings ⋮ A short proof of a theorem of Bang and Koolen ⋮ A note on Hoffman-type identities of graphs ⋮ A bibliography of graph equations ⋮ Spectral bounds and distance-regularity ⋮ Line graphs, root systems, and elliptic geometry ⋮ The factors of a design matrix ⋮ The geometry oft-spreads ink-walk-regular graphs ⋮ Automorphism group and category of cospectral graphs ⋮ Special partially balanced incomplete block designs and associated graphs ⋮ A spectral characterization of the line graph of a BIBD with \(\lambda=1\) ⋮ Algebraic characterizations of regularity properties in bipartite graphs ⋮ Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity ⋮ A characterization of weight-regular partitions of graphs ⋮ On a version of the spectral excess theorem ⋮ \(X^k\)-digraphs ⋮ On a class of distance transitive graphs ⋮ A spectral characterization of the \(s\)-clique extension of the triangular graphs ⋮ The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs ⋮ Eigenvalues of the adjacency matrix of tetrahedral graphs ⋮ On the weak distance-regularity of Moore-type digraphs ⋮ On characterizing certain graphs with four eigenvalues by their spectra ⋮ Geometric and pseudo-geometric graphs \((q^ 2 + 1,q + 1,1)\) ⋮ The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular ⋮ Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues ⋮ Three-class association schemes ⋮ Main eigenvalues and automorphisms of a graph ⋮ Constructing cospectral graphs via regular rational orthogonal matrices with level two ⋮ On Middle Cube Graphs ⋮ On the spectrum, the growth, and the diameter of a graph ⋮ Spectral characterizations of some distance-regular graphs ⋮ Polynomial addition sets and polynomial digraphs
This page was built for publication: On the Polynomial of a Graph
