On the Polynomial of a Graph

Cited In (only showing first 100 items - show all)

Graph-polynomials
On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes
Edge-distance-regular graphs are distance-regular
Title not available (Why is that?)
A simple proof of the spectral excess theorem for distance-regular graphs
Le Polynôme De Martin D'un Graphe Eulerien
A spectral excess theorem for nonregular graphs
The interlace polynomial of a graph
Dual concepts of almost distance-regularity and the spectral excess theorem
On Middle Cube Graphs
Some results on covers of complete graphs
Characterizing \((\ell ,m)\)-walk-regular graphs
Three-class association schemes
A surprising property of the least eigenvalue of a graph
The Polynomial of a Directed Graph
On the weak distance-regularity of Moore-type digraphs
A short proof of a theorem of Bang and Koolen
Two spectral characterizations of regular, bipartite graphs with five eigenvalues
A note on Hoffman-type identities of graphs
5-chromatic strongly regular graphs
Spectral characterizations of some distance-regular graphs
A characterization of distance-regular graphs with diameter three
Line graphs, root systems, and elliptic geometry
Algebraic characterizations of graph regularity conditions
Polynomial addition sets and polynomial digraphs
Eigenvalues of a graph and its imbeddings
Entropy and the complexity of graphs: III. Graphs with prescribed information content
On a version of the spectral excess theorem
Which graphs are determined by their spectrum?
Distance-regularity and the spectrum of graphs
Hypercubes are determined by their distance spectra
From local adjacency polynomials to locally pseudo-distance-regular graphs
On characterizing certain graphs with four eigenvalues by their spectra
Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs
On the Polarity and Monopolarity of Graphs
The Laplacian spectral excess theorem for distance-regular graphs
Some spectral and quasi-spectral characterizations of distance-regular graphs
Hoffman-type identities
On the spectrum, the growth, and the diameter of a graph
The symbiotic relationship of combinatorics and matrix theory
Spectral characterization of the Hamming graphs
Characterizing distance-regularity of graphs by the spectrum
Linear programming bounds for regular graphs
Boundary graphs. II: The limit case of a spectral property
Multiplicative designs II. Uniform normal and related structures
Q-integral graphs with edge-degrees at most five
The Go polynomials of a graph.
On almost distance-regular graphs
On a characterization of irreducibility of a non-negative matrix
Quotient-polynomial graphs
Directed strongly regular graphs obtained from coherent algebras
Spectral bounds and distance-regularity
Largest regular multigraphs with three distinct eigenvalues
On graphs with given main eigenvalues
On the Line Graph of a Symmetric Balanced Incomplete Block Design
Graphs cospectral with distance-regular graphs
Polynomial approximation on graphs
Geometric and pseudo-geometric graphs \((q^ 2 + 1,q + 1,1)\)
On symmetric association schemes and associated quotient-polynomial graphs
On the adjacency algebras of near hexagons with an order
An application of Hoffman graphs for spectral characterizations of graphs
A characterization of bipartite distance-regular graphs
\(X^k\)-digraphs
On the Line Graph of a Projective Plane
Regular graphs with four eigenvalues
A survey of some problems in combinatorial designs - a matrix approach
The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular
Title not available (Why is that?)
Special partially balanced incomplete block designs and associated graphs
On some approaches to the spectral excess theorem for nonregular graphs
Polynomials on graphs
The spectral excess theorem for distance-biregular graphs.
The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
A spectral characterization of the \(s\)-clique extension of the triangular graphs
The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues
Algebraic characterizations of regularity properties in bipartite graphs
Two characterizations of the grid graphs
On a class of distance transitive graphs
Algebraic connectedness and bipartiteness of quantum graphs
The factors of a design matrix
A spectral characterization of the \(s\)-clique extension of the square grid graphs
Eigenvalues of the adjacency matrix of tetrahedral graphs
Uniqueness of the rank polynomials of point stable designs
A characterization and an application of weight-regular partitions of graphs
Title not available (Why is that?)
On outindependent subgraphs of strongly regular graphs
Automorphism group and category of cospectral graphs
Title not available (Why is that?)
A characterization of weight-regular partitions of graphs
A spectral characterization of the line graph of a BIBD with \(\lambda=1\)
Attainable bounds for algebraic connectivity and maximally connected regular graphs
Representation of cyclotomic fields and their subfields
Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
Spectral properties of the eccentricity matrix of graphs
The Penrose polynomial of a plane graph
Pattern polynomial graphs
A characterization of the Grassmann graphs
A bibliography of graph equations
Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues

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)