Cited in
(only showing first 100 items - show all)- Polynomial addition sets and polynomial digraphs
- A survey of some problems in combinatorial designs - a matrix approach
- Polynomials on graphs
- Uniqueness of the rank polynomials of point stable designs
- Multiplicative designs II. Uniform normal and related structures
- A surprising property of the least eigenvalue of a graph
- The symbiotic relationship of combinatorics and matrix theory
- On a characterization of irreducibility of a non-negative matrix
- Line graphs, root systems, and elliptic geometry
- The factors of a design matrix
- Special partially balanced incomplete block designs and associated graphs
- A spectral characterization of the line graph of a BIBD with \(\lambda=1\)
- X^k-digraphs
- On a class of distance transitive graphs
- The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
- Three-class association schemes
- On the spectrum, the growth, and the diameter of a graph
- The Penrose polynomial of a plane graph
- A characterization of distance-regular graphs with diameter three
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- Boundary graphs. II: The limit case of a spectral property
- Which graphs are determined by their spectrum?
- Directed strongly regular graphs obtained from coherent algebras
- The Go polynomials of a graph.
- Some results on covers of complete graphs
- Hoffman-type identities
- Graph-polynomials
- Spectral characterizations of some distance-regular graphs
- A spectral characterization of the \(s\)-clique extension of the square grid graphs
- On the adjacency algebras of near hexagons with an order
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
- Algebraic characterizations of graph regularity conditions
- Spectral bounds and distance-regularity
- A characterization of weight-regular partitions of graphs
- Regular graphs with four eigenvalues
- Distance-regularity and the spectrum of graphs
- Two characterizations of the grid graphs
- Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues
- Constructing cospectral graphs via regular rational orthogonal matrices with level two
- Spectral properties of the eccentricity matrix of graphs
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
- The Laplacian spectral excess theorem for distance-regular graphs
- Eigenvalues of a graph and its imbeddings
- A spectral characterization of the \(s\)-clique extension of the triangular graphs
- Representation of cyclotomic fields and their subfields
- A characterization and an application of weight-regular partitions of graphs
- Largest regular multigraphs with three distinct eigenvalues
- On almost distance-regular graphs
- A characterization of bipartite distance-regular graphs
- Algebraic characterizations of regularity properties in bipartite graphs
- Eigenvalues of the adjacency matrix of tetrahedral graphs
- On characterizing certain graphs with four eigenvalues by their spectra
- Geometric and pseudo-geometric graphs (q^ 2 + 1,q + 1,1)
- 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
- Hypercubes are determined by their distance spectra
- scientific article; zbMATH DE number 6378508 (Why is no real title available?)
- The geometry of t-spreads in k-walk-regular graphs
- scientific article; zbMATH DE number 7217234 (Why is no real title available?)
- Le Polynôme De Martin D'un Graphe Eulerien
- Main eigenvalues and automorphisms of a graph
- scientific article; zbMATH DE number 6530312 (Why is no real title available?)
- scientific article; zbMATH DE number 3906512 (Why is no real title available?)
- Edge-distance-regular graphs are distance-regular
- A bibliography of graph equations
- On some approaches to the spectral excess theorem for nonregular graphs
- The spectral excess theorem for distance-biregular graphs.
- On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes
- Automorphism group and category of cospectral graphs
- A spectral excess theorem for nonregular graphs
- Dual concepts of almost distance-regularity and the spectral excess theorem
- Some graphs determined by their distance spectrum
- Graphs cospectral with distance-regular graphs
- On a version of the spectral excess theorem
- On middle cube graphs
- An application of Hoffman graphs for spectral characterizations of graphs
- Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
- The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular
- On outindependent subgraphs of strongly regular graphs
- Some spectral and quasi-spectral characterizations of distance-regular graphs
- The Polynomial of a Directed Graph
- On the Line Graph of a Projective Plane
- On the Polarity and Monopolarity of Graphs
- On the weak distance-regularity of Moore-type digraphs
- Two spectral characterizations of regular, bipartite graphs with five eigenvalues
- On the Line Graph of a Symmetric Balanced Incomplete Block Design
- Entropy and the complexity of graphs: III. Graphs with prescribed information content
- A note on Hoffman-type identities of graphs
- The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues
- Characterizing ( ,m)-walk-regular graphs
- Graph isomorphism: physical resources, optimization models, and algebraic characterizations
- Algebraic connectedness and bipartiteness of quantum graphs
- Attainable bounds for algebraic connectivity and maximally connected regular graphs
- A characterization of the Grassmann graphs
- Pattern polynomial graphs
- On co-edge-regular graphs with 4 distinct eigenvalues
- Polynomial characterizations of distance-biregular graphs
- On commutative association schemes and associated (directed) graphs
- Spectral methods for matrix product factorization
- The interlace polynomial of a graph
This page was built for publication: On the Polynomial of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3850554)
