On the enumeration of certain weighted graphs

DOI10.1016/j.dam.2007.04.001zbMath1149.90162arXivmath/0606163OpenAlexW2076656020MaRDI QIDQ997075

Hyeong-Kwan Ju, Ruriko Yoshida, Miklós Bóna

Publication date: 19 July 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0606163

zbMATH Keywords

weighted graphsrational generating functionsrational convex polytopesEhrhart (quasi-)polynomial

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Proving some conjectures on Kekulé numbers for certain benzenoids by using Chebyshev polynomials ⋮ Different Volume Computation Methods of Graph Polytopes ⋮ Unnamed Item

Uses Software

• cdd
• LattE
• Omega

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On certain polytopes associated with graphs
• Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff conference on ordered sets
• A fast algorithm for MacMahon's partition analysis
• Combinatorics and commutative algebra.
• Enumerating solutions of a system of linear inequalities related to magic squares
• Effective lattice point counting in rational convex polytopes
• Computing the Continuous Discretely
• Lectures on Polytopes
• ENUMERATION OF WEIGHTED COMPLETE GRAPHS
• Algorithms – ESA 2004
• Ordered structures and partitions
• MacMahon's partition analysis: The Omega package