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-1MaRDI QIDQ1255017zbMATH OpenFDO

Authors E. J. Farrell

Publication date 1979

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(79)90014-1

zbMATH Keywords

Characteristic Polynomials of GraphsCircuits

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites work

• A graph polynomial and its applications
• A Search Procedure for Hamilton Paths and Circuits
• Cospectral Graphs and Digraphs
• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3222645 (Why is no real title available?)
• scientific article; zbMATH DE number 3411062 (Why is no real title available?)
• On a general class of graph polynomials
• Parallel concepts in graph theory
• The characteristic polynomial of a graph

Cited in

(7)

• A note on the circuit polynomials and characteristic polynomials of wheels and ladders
• The cycle-path indicator polynomial of a digraph
• 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
• The circuit polynomial of the restricted rooted product G( ) of graphs with a bipartite core G
• The cycle (circuit) polynomial of a graph with double and triple weights of edges and cycles
• On F-polynomials of thistles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1255017)