English

PQ-type adjacency polytopes of join graphs

Combinatorics 2023-07-14 v1

Abstract

PQ-type adjacency polytopes GPQ\nabla^{\rm PQ}_G are lattice polytopes arising from finite graphs GG. There is a connection between GPQ\nabla^{\rm PQ}_G 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 GPQ\nabla^{\rm PQ}_G plays a central role. In the present paper, we focus the case where GG is a join graph. In fact, formulas of the hh^*-polynomial and the normalized volume of GPQ\nabla^{\rm PQ}_G of a join graph GG are presented. Moreover, we give explicit formulas of the hh^*-polynomial and the normalized volume of GPQ\nabla^{\rm PQ}_G when GG is a complete multipartite graph or a wheel graph.

Keywords

Cite

@article{arxiv.2103.15045,
  title  = {PQ-type adjacency polytopes of join graphs},
  author = {Hidefumi Ohsugi and Akiyoshi Tsuchiya},
  journal= {arXiv preprint arXiv:2103.15045},
  year   = {2023}
}

Comments

18 pages, 1 figure

R2 v1 2026-06-24T00:37:08.611Z