On generic forms of complementary graphs

DOI10.1016/0016-0032(83)90085-6MaRDI QIDQ1056766zbMATH OpenOpenAlexWikidataFDO

Authors J. 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

complementary graphcomplete multigraphspanning trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99)

Cites work

• A certain polynomial of a graph and graphs with an extremal number of trees
• Comparison of graphs by their number of spanning trees
• Generating formulas for the number of trees in a graph
• scientific article; zbMATH DE number 3126031 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3324508 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• On topological approaches to network theory
• The Fibonacci numbers via trigonometric expressions
• The number of trees in a graph. I. II
• The second moment of the complexity of a graph
• Tree counting polynomials for labelled graphs. I: Properties

Cited in

(1)

• Counting trees in directed regular multigraphs

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

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