A graph polynomial and its applications

DOI10.1016/0012-365X(72)90088-XMaRDI QIDQ2554705zbMATH OpenFDO

Authors F. H. Clarke

Publication date 1972

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(72)90088-X

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (05Cxx)

Cites work

• A congruence theorem for trees
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• scientific article; zbMATH DE number 3257166 (Why is no real title available?)
• scientific article; zbMATH DE number 3267982 (Why is no real title available?)
• scientific article; zbMATH DE number 3060538 (Why is no real title available?)
• Parallel concepts in graph theory
• Spektren endlicher Grafen
• The Determinant of the Adjacency Matrix of a Graph
• The Factorization of Linear Graphs
• Ulam's Conjecture and Graph Reconstructions

Cited in

(20)

• The number of trees with a 1-factor
• Trees with 1-factors and oriented trees
• Note sur le problème de Ulam
• On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs
• Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
• Odd factors of a graph
• Factors of trees
• On the change of the Jordan form under the transition from the adjacency matrix of a vertex-transitive digraph to its principal submatrix of co-order one
• Polynomial reconstruction and terminal vertices
• The increase in the resolvent energy of a graph due to the addition of a new edge
• The polynomial reconstruction problem: the first 50 years
• Exceptional graphs with smallest eigenvalue -2 and related problems
• scientific article; zbMATH DE number 7640508 (Why is no real title available?)
• ON A CLASS OF GOLDEN GRAPHS
• Graph theory (algorithmic, algebraic, and metric problems)
• Reconstruction from one labelled card and more
• The polynomial reconstruction problem for graphs having cut-vertices of degree two
• Alternating Whitney sums and matchings in trees. II
• On the multiplicity of the eigenvalues of a graph
• Graphs with a common eigenvalue deck

This page was built for publication: A graph polynomial and its applications

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