On the Polynomial of a Graph
From MaRDI portal
Publication:3850554
Cited in
(only showing first 100 items - show all)- On some approaches to the spectral excess theorem for nonregular graphs
- scientific article; zbMATH DE number 3906512 (Why is no real title available?)
- The spectral excess theorem for distance-biregular graphs.
- Polynomials on graphs
- The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular
- The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
- Constructing cospectral graphs via regular rational orthogonal matrices with level two
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number
- Graph isomorphism: physical resources, optimization models, and algebraic characterizations
- 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
- 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
- scientific article; zbMATH DE number 6378508 (Why is no real title available?)
- A simple proof of the spectral excess theorem for distance-regular graphs
- Algebraic characterizations of regularity properties in bipartite graphs
- A spectral excess theorem for nonregular graphs
- Two characterizations of the grid graphs
- The interlace polynomial of a graph
- Dual concepts of almost distance-regularity and the spectral excess theorem
- Le Polynôme De Martin D'un Graphe Eulerien
- On a class of distance transitive graphs
- Some results on covers of complete graphs
- Characterizing \((\ell ,m)\)-walk-regular graphs
- A surprising property of the least eigenvalue of a graph
- Three-class association schemes
- A short proof of a theorem of Bang and Koolen
- The Polynomial of a Directed Graph
- On the weak distance-regularity of Moore-type digraphs
- 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
- Algebraic connectedness and bipartiteness of quantum graphs
- A characterization of distance-regular graphs with diameter three
- Line graphs, root systems, and elliptic geometry
- The factors of a design matrix
- Polynomial addition sets and polynomial digraphs
- Algebraic characterizations of graph regularity conditions
- Eigenvalues of a graph and its imbeddings
- Which graphs are determined by their spectrum?
- Entropy and the complexity of graphs: III. Graphs with prescribed information content
- Hypercubes are determined by their distance spectra
- On a version of the spectral excess theorem
- Distance-regularity and the spectrum of graphs
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs
- A spectral characterization of the \(s\)-clique extension of the square grid graphs
- On characterizing certain graphs with four eigenvalues by their spectra
- Some graphs determined by their distance spectrum
- Uniqueness of the rank polynomials of point stable designs
- Eigenvalues of the adjacency matrix of tetrahedral graphs
- Some spectral and quasi-spectral characterizations of distance-regular graphs
- A characterization and an application of weight-regular partitions of graphs
- The Laplacian spectral excess theorem for distance-regular graphs
- Hoffman-type identities
- On the spectrum, the growth, and the diameter of a graph
- On the Polarity and Monopolarity of Graphs
- The symbiotic relationship of combinatorics and matrix theory
- Spectral characterization of the Hamming graphs
- Characterizing distance-regularity of graphs by the spectrum
- scientific article; zbMATH DE number 6530312 (Why is no real title available?)
- Linear programming bounds for regular graphs
- On outindependent subgraphs of strongly regular graphs
- Automorphism group and category of cospectral 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 middle cube graphs
- On a characterization of irreducibility of a non-negative matrix
- Quotient-polynomial graphs
- On almost distance-regular graphs
- scientific article; zbMATH DE number 7217234 (Why is no real title available?)
- A characterization of weight-regular partitions of graphs
- A spectral characterization of the line graph of a BIBD with \(\lambda=1\)
- Directed strongly regular graphs obtained from coherent algebras
- Spectral bounds and distance-regularity
- Attainable bounds for algebraic connectivity and maximally connected regular graphs
- Representation of cyclotomic fields and their subfields
- The geometry of \(t\)-spreads in \(k\)-walk-regular graphs
- On graphs with given main eigenvalues
- Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
- Largest regular multigraphs with three distinct eigenvalues
- On the Line Graph of a Symmetric Balanced Incomplete Block Design
- Graphs cospectral with distance-regular graphs
- Polynomial approximation on graphs
- The Penrose polynomial of a plane graph
- Spectral properties of the eccentricity matrix of graphs
- Geometric and pseudo-geometric graphs \((q^ 2 + 1,q + 1,1)\)
- Pattern polynomial graphs
- On symmetric association schemes and associated quotient-polynomial graphs
- A characterization of the Grassmann graphs
- Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues
- A bibliography of graph equations
- 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
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)