On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs

DOI10.1016/0012-365X(79)90014-1zbMath0401.05057MaRDI QIDQ1255017

E. J. Farrell

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

CircuitsCharacteristic Polynomials of Graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (7)

Enumeration of substitutional isomers with restrictive mutual positions of ligands. II. Counts with restrictions on (sub)symmetry ⋮ Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts ⋮ A note on the circuit polynomials and characteristic polynomials of wheels and ladders ⋮ The circuit polynomial of the restricted rooted product \(G(\Gamma )\) of graphs with a bipartite core \(G\) ⋮ On F-polynomials of thistles ⋮ The cycle-path indicator polynomial of a digraph ⋮ The cycle (circuit) polynomial of a graph with double and triple weights of edges and cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a general class of graph polynomials
• Parallel concepts in graph theory
• The characteristic polynomial of a graph
• A graph polynomial and its applications
• A Search Procedure for Hamilton Paths and Circuits
• Cospectral Graphs and Digraphs

This page was built for publication: On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs