PQ-type adjacency polytopes of join graphs
Combinatorics
2023-07-14 v1
Abstract
PQ-type adjacency polytopes are lattice polytopes arising from finite graphs . There is a connection between 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 plays a central role. In the present paper, we focus the case where is a join graph. In fact, formulas of the -polynomial and the normalized volume of of a join graph are presented. Moreover, we give explicit formulas of the -polynomial and the normalized volume of when is a complete multipartite graph or a wheel graph.
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