PQ-type adjacency polytopes of join graphs

DOI10.1007/S00454-022-00447-ZMaRDI QIDQ6156092zbMATH OpenOpenAlexFDO

Authors Hidefumi Ohsugi, Akiyoshi Tsuchiya

Publication date 12 June 2023

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

root polytopejoin graphinterior polynomial\(h^\ast\)-polynomialadjacency polytopeperfectly matchable set

Mathematics Subject Classification ID

Graph polynomials (05C31) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Abstract: PQ-type adjacency polytopes $abl{a}_G^{mPQ}$ are lattice polytopes arising from finite graphs $G$. There is a connection between $abl{a}_G^{mPQ}$ and the engineering problem known as power-flow study, which models the balance of electric power on a network of power generation. In particular, the normalized volume of $abl{a}_G^{mPQ}$ plays a central role. In the present paper, we focus the case where $G$ is a join graph. In fact, formulas of the $h^{\ast }$-polynomial and the normalized volume of $abl{a}_G^{mPQ}$ of a join graph $G$ are presented. Moreover, we give explicit formulas of the $h^{\ast }$-polynomial and the normalized volume of $abl{a}_G^{mPQ}$ when $G$ is a complete multipartite graph or a wheel graph.

Recommendations

• Computing volumes of adjacency polytopes via Draconian sequences
• Volume of graph polytopes for the path-star type graphs
• scientific article; zbMATH DE number 3952461
• The lattice polynomial of a graph.
• Tutte polynomial of a two point join graph and its application

Cites work

• scientific article; zbMATH DE number 3524004 (Why is no real title available?)
• A version of Tutte's polynomial for hypergraphs
• Arithmetic aspects of symmetric edge polytopes
• Computing the Continuous Discretely
• Computing volumes of adjacency polytopes via Draconian sequences
• Counting Equilibria of the Kuramoto Model Using Birationally Invariant Intersection Index
• Many faces of symmetric edge polytopes
• Permutohedra, Associahedra, and Beyond
• Polynômes arithmétiques et méthode des polyedres en combinatoire
• Reflexive polytopes arising from bipartite graphs with \(\gamma\)-positivity associated to interior polynomials
• Root Polytopes and Growth Series of Root Lattices
• Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs
• Symmetric edge polytopes and matching generating polynomials
• The \(h^\ast\)-polynomials of locally anti-blocking lattice polytopes and their \(\gamma\)-positivity
• The perfectly matchable subgraph polytope of a bipartite graph
• The perfectly matchable subgraph polytope of an arbitrary graph

Cited in

(3)

• Computing volumes of adjacency polytopes via Draconian sequences
• Normalized volumes of type-PQ adjacency polytopes for certain classes of graphs
• Toric rings of perfectly matchable subgraph polytopes

This page was built for publication: PQ-type adjacency polytopes of join graphs

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