A graph polynomial and its applications

DOI10.1016/0012-365X(72)90088-XzbMath0244.05111MaRDI QIDQ2554705

Frank H. Clarke

Publication date: 1972

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

Mathematics Subject Classification ID

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

Related Items

Factors of trees, The number of trees with a 1-factor, ON A CLASS OF GOLDEN GRAPHS, On the multiplicity of the eigenvalues of a graph, Exceptional graphs with smallest eigenvalue -2 and related problems, 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, Trees with 1-factors and oriented trees, Graphs with a common eigenvalue deck, Unnamed Item, 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, Note sur le problème de Ulam, Graph theory (algorithmic, algebraic, and metric problems), On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs, Alternating Whitney sums and matchings in trees. II, Polynomial reconstruction and terminal vertices, Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Odd factors of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spektren endlicher Grafen
• A congruence theorem for trees
• Parallel concepts in graph theory
• The Determinant of the Adjacency Matrix of a Graph
• Ulam's Conjecture and Graph Reconstructions
• The Factorization of Linear Graphs