PQ-Type Adjacency Polytopes of Join Graphs
نویسندگان
چکیده
Abstract PQ-type adjacency polytopes $$\nabla ^PQ _G$$ ∇ P Q G are lattice arising from finite graphs G . There is a connection between and the engineering problem known as power-flow study, which models balance of electric power on network generation. In particular, normalized volume plays central role. present paper, we focus case where join graph. formulas $$h^*$$ h ∗ -polynomial graph presented. Moreover, give explicit when complete multipartite or wheel
منابع مشابه
Symmetry Type Graphs of Polytopes and Maniplexes
A k-orbit maniplex is one that has k orbits of flags under the action of its automorphism group. In this paper we extend the notion of symmetry type graphs of maps to that of maniplexes and polytopes and make use of them to study k-orbit maniplexes, as well as fully-transitive 3-maniplexes. In particular, we show that there are no fully-transtive korbit 3-mainplexes with k > 1 an odd number, we...
متن کاملComplementary Vertices and Adjacency Testing in Polytopes
Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e., two vertices with no facets in common), then it has a second such pair. Using this result, we improve adjacency testing for vertices in both simple and non-simple polytopes: given a polytope in the standard form {x ∈ R |Ax = b and x ≥ 0} and a list of its V vertices, we describe an O(n) test to...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملNormalized laplacian spectrum of two new types of join graphs
Let $G$ be a graph without an isolated vertex, the normalized Laplacian matrix $tilde{mathcal{L}}(G)$ is defined as $tilde{mathcal{L}}(G)=mathcal{D}^{-frac{1}{2}}mathcal{L}(G)mathcal{D}^{-frac{1}{2}}$, where $mathcal{D}$ is a diagonal matrix whose entries are degree of vertices of $G$. The eigenvalues of $tilde{mathcal{L}}(G)$ are called as the normalized Laplacian eigenva...
متن کاملSIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
In this paper we study the signed Roman dominationnumber of the join of graphs. Specially, we determine it for thejoin of cycles, wheels, fans and friendship graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2022
ISSN: ['1432-0444', '0179-5376']
DOI: https://doi.org/10.1007/s00454-022-00447-z