On generic forms of complementary graphs

DOI10.1016/0016-0032(83)90085-6zbMath0523.05059OpenAlexW2004357105WikidataQ127321252 ScholiaQ127321252MaRDI QIDQ1056766

John W. Moon, Samuel D. Bedrosian

Publication date: 1983

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(83)90085-6

zbMATH Keywords

spanning treescomplementary graphcomplete multigraph

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99)

Related Items (1)

Counting trees in directed regular multigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tree counting polynomials for labelled graphs. I: Properties
• The Fibonacci numbers via trigonometric expressions
• Comparison of graphs by their number of spanning trees
• A certain polynomial of a graph and graphs with an extremal number of trees
• Generating formulas for the number of trees in a graph
• On topological approaches to network theory
• The number of trees in a graph. I. II
• The second moment of the complexity of a graph

This page was built for publication: On generic forms of complementary graphs