On generic forms of complementary graphs
type: Item
instance of: scholarly article
title: On generic forms of complementary graphs
zbMATH Open document ID: 0523.05059
DOI: 10.1016/0016-0032(83)90085-6
published in: Journal of the Franklin Institute
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 3827933
zbMATH Keywords: complementary graph
zbMATH Keywords: spanning trees
zbMATH Keywords: complete multigraph
author: J. W. Moon
author: Samuel D. Bedrosian
MaRDI profile type: Publication
full work available at URL: 0016-0032(83)90085-6
OpenAlex ID: W2004357105
cites work: Generating formulas for the number of trees in a graph
cites work: The Fibonacci numbers via trigonometric expressions
cites work: Tree counting polynomials for labelled graphs. I: Properties
cites work: Q3907599
cites work: Q3241504
cites work: The number of trees in a graph. I. II
cites work: Comparison of graphs by their number of spanning trees
cites work: A certain polynomial of a graph and graphs with an extremal number of trees
cites work: On topological approaches to network theory
cites work: The second moment of the complexity of a graph
cites work: Q5602686
cites work: Q5616724
Wikidata QID: Q127321252
description: scientific article; zbMATH DE number 3827933