Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Enumeration of graphs by degree sequence

From MaRDI portal
Publication:3048860
Jump to:navigation, search

DOI10.1002/JGT.3190030313zbMATH Open0414.05026OpenAlexW1999567411MaRDI QIDQ3048860FDOQ3048860


Authors: Philip J. Hanlon Edit this on Wikidata


Publication date: 1979

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190030313





zbMATH Keywords

generating functiondegree sequence


Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)


Cites Work

  • Enumeration of Graphs with Given Partition


Cited In (2)

  • Recognition of split-graphic sequences
  • Spectral bounds for the connectivity of regular graphs with given order





This page was built for publication: Enumeration of graphs by degree sequence

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3048860&oldid=16093869"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:42. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki