2022
DOI: 10.48550/arxiv.2202.09853
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Normalized Volumes of Type-PQ Adjacency Polytopes for Certain Classes of Graphs

Abstract: The type-PQ adjacency polytope associated to a simple graph is a 0/1-polytope containing valuable information about an underlying power network. Chen and the first author have recently demonstrated that, when the underlying graph G is connected, the normalized volumes of the adjacency polytopes can be computed by counting sequences of nonnegative integers satisfying restrictions determined by G. This article builds upon their work, namely by showing that one of their main results -the so-called "triangle recur… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 9 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?