A new graph product and its spectrum
From MaRDI portal
Publication:4154592
DOI10.1017/S0004972700007760zbMATH Open0376.05049OpenAlexW1994990018WikidataQ55951897 ScholiaQ55951897MaRDI QIDQ4154592FDOQ4154592
Chris Godsil, Brendan D. McKay
Publication date: 1978
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972700007760
Cites Work
Cited In (only showing first 100 items - show all)
- Algebras of binary isolating formulas for theories of root products of graphs
- On the hierarchical product of graphs and the generalized binomial tree
- Partially ordering the class of invertible trees
- A new method for constructing graphs determined by their generalized spectrum
- 2-Distance chromatic number of some graph products
- The terminal Hosoya polynomial of some families of composite graphs
- Clique cover products and unimodality of independence polynomials
- On the strong metric dimension of product graphs
- The \(k\)-path vertex cover of rooted product graphs
- On some graphs which satisfy reciprocal eigenvalue properties
- The signless Laplacian spectrum of rooted product of graphs
- On metric dimensions of symmetric graphs obtained by rooted product
- Prime factorization and domination in the hierarchical product of graphs
- The circuit polynomial of the restricted rooted product \(G(\Gamma )\) of graphs with a bipartite core \(G\)
- Spectra of M-rooted product of graphs
- Unimodality of independence polynomials of rooted products of graphs
- On the characteristic and Laplacian polynomials of trees
- Unimodality of the independence polynomials of some composite graphs
- Spectral Radius of Graphs
- The independence polynomial of rooted products of graphs
- Noncorona graphs with strong anti-reciprocal eigenvalue property
- Class of weighted graphs with strong anti-reciprocal eigenvalue property
- Fast algorithms for computing the characteristic polynomial of threshold and chain graphs
- Close-to-zero eigenvalues of the rooted product of graphs
- Further results on 2-distance coloring of graphs
- Graphs with reciprocal eigenvalue properties
- Generalized spectral characterization of rooted product graphs
- Partition dimension of rooted product graphs
- Graphs cospectral with starlike trees
- Estimation of Synchronization Patterns of Chaotic Systems in Cartesian Product Networks with Delay Couplings
- Nullity of Graphs
- On the smallest eigenvalues of the line graphs of some trees
- On vertices contained in all or in no metric basis
- Title not available (Why is that?)
- Strong reciprocal eigenvalue property of a class of weighted graphs
- Graph operations preserving \(W_{2}\)-property
- Maximal 2-rainbow domination number of a graph
- Edge metric dimensions via hierarchical product and integer linear programming
- The general position problem and strong resolving graphs
- Vertex types in some lexicographic products of graphs
- Signed graphs with strong anti-reciprocal eigenvalue property
- Spectra of coronae
- On maximal Roman domination in graphs
- Strong metric dimension of rooted product graphs
- Unimodality of independence polynomials of the incidence product of graphs
- Perron value and moment of rooted trees
- Spectra of \(M\)-edge rooted product of graphs
- Inverses of trees
- Computing the local metric dimension of a graph from the local metric dimension of primary subgraphs
- On real-rootedness of independence polynomials of rooted products of graphs
- Beating the generator-enumeration bound for \(p\)-group isomorphism
- Computing the metric dimension of a graph from primary subgraphs
- Developments in the theory of graph spectra
- On the independence transversal total domination number of graphs
- Construction of graphs with distinct eigenvalues
- Some new families of noncorona graphs with strong anti-reciprocal eigenvalue property
- Domination-related parameters in rooted product graphs
- Classes of nonbipartite graphs with reciprocal eigenvalue property
- Unimodality of independence polynomials of the cycle cover product of graphs
- On the strong Roman domination number of graphs
- On the characteristic polynomial of a special class of graphs and spectra of balanced trees
- The independent set sequence of some families of trees
- Some results on starlike and sunlike graphs
- Bounds for the general sum-connectivity index of composite graphs
- Trees with real rooted independence polynomials
- Generation of anti-magic graphs from binary graph products
- RANDIĆ ENERGY OF VARIOUS GRAPHS
- Resolvability and convexity properties in the Sierpiński product of graphs
- Title not available (Why is that?)
- Unique response strong Roman dominating functions of graphs
- A note on graphs with purely imaginary per-spectrum
- Iterated open neighborhood graphs and generalizations
- Proof of a conjecture on the determinant of the walk matrix of rooted product with a path
- Equi neighbor polynomial of some binary graph operations
- On metric dimension of subdivided honeycomb network and Aztec diamond network
- Trees with the reciprocal eigenvalue property
- Spectra of (M,ℳ)-corona-join of graphs
- CONSENSUS ANALYSIS IN HIERARCHICAL NETWORKED SYSTEMS
- Complexity of 2-rainbow total domination problem
- Vertex neighborhood restricted edge achromatic sums of graphs
- Vertex decomposability, shellability and Cohen-Macaulayness of graphs upon graph operations
- Average mixing matrix of trees
- Construction of graphs with distinct \(A_\alpha \)-eigenvalues
- Minimal Embedding Dimensions of Rectangle k-Visibility Graphs
- On the determinant of the \(Q\)-walk matrix of rooted product with a path
- Edge version of SDD and ISI index for rooted product graphs
- Domination-related parameters in middle graphs
- Inverse of the adjacency matrices and strong anti-reciprocal eigenvalue property
- Sierpiński products of r-uniform hypergraphs
- Spectra of comb graphs with tails
- Convex subgraph polynomials of degree 3 or 4, rooted and co-normal products of graphs
- (Open) packing number of some graph products
- Title not available (Why is that?)
- Algebraic connectivity of network-of-networks having a graph product structure
- The normalized Laplacian polynomial of rooted product of graphs
- Title not available (Why is that?)
- Cyclic independence: Boolean and monotone
- Closed formulas for the independent (Roman) domination number of rooted product graphs
- The study of line graphs of subdivision graphs of some rooted product graphs via K-Banhatti indices
- Further results on maximal rainbow domination number
This page was built for publication: A new graph product and its spectrum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154592)