The circuit polynomial of the restricted rooted product \(G(\Gamma )\) of graphs with a bipartite core \(G\)
From MaRDI portal
Publication:2473046
DOI10.1016/j.dam.2006.06.015zbMath1135.05064arXivmath/0304190OpenAlexW2050408465MaRDI QIDQ2473046
Publication date: 26 February 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0304190
Related Items
Some differential properties of Pólya's cycle indicators ⋮ The independence polynomial of rooted products of graphs ⋮ Close-to-zero eigenvalues of the rooted product of graphs ⋮ The spectrum of the vertex quadrangulation of a 4-regular toroidal graph and beyond ⋮ The cycle (circuit) polynomial of a graph with double and triple weights of edges and cycles
Cites Work
- An introduction to \(F\)-graphs, a graph-theoretic representation of natural numbers
- Recent results in the theory of graph spectra
- On a general class of graph polynomials
- On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs
- Applied finite group actions.
- A new graph product and its spectrum
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item