The number of labeled connected graphs modulo prime powers

DOI10.1137/15M1024615zbMATH Open1336.05066OpenAlexW2403821287MaRDI QIDQ2808161FDOQ2808161

Douglas S. Stones, Arun P. Mani

Publication date: 26 May 2016

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

Full work available at URL: https://doi.org/10.1137/15m1024615

Recommendations

• Congruences for weighted number of labeled forests
• Enumeration of connected invariant graphs
• Publication:4945873
• Connectedness, Classes and Cycle Index
• scientific article; zbMATH DE number 279643

zbMATH Keywords

Tutte polynomialconnected graphs

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Connectivity (05C40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorial aspects of network reliability
• Title not available (Why is that?)
• Congruences for weighted number of labeled forests

Cited In (3)

• On the Tutte and Matching Polynomials for Complete Graphs
• Connectivity of natural modular graphs
• Title not available (Why is that?)

Uses Software

• OEIS

This page was built for publication: The number of labeled connected graphs modulo prime powers

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