scholarly journals On the total irregularity strength of convex polytope graphs

2021 ◽  
Author(s):  
Syed Ahtshma Ul Haq Bokhary ◽  
Muhammad Imran ◽  
Usman Ali
Keyword(s):  
Convex Polytopes ◽  
Convex Polytope ◽  
Irregularity Strength ◽  
Total Edge Irregularity Strength ◽  
Prism Graph

A vertex (edge) irregular total k-labeling ? of a graph G is a labeling of the vertices and edges of G with labels from the set {1,2,...,k} in such a way that any two different vertices (edges) have distinct weights. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x, whereas the weight of an edge is the sum of label of the edge and the vertices incident to that edge. The minimum k for which the graph G has a vertex (edge) irregular total k-labeling is called the total vertex (edge) irregularity strength of G. In this paper, we are dealing with infinite classes of convex polytopes generated by prism graph and antiprism graph. We have determined the exact value of their total vertex irregularity strength and total edge irregularity strength.

scholarly journals A short note on extreme points of certain polytopes

2020 ◽  
Vol 8 (1) ◽  
pp. 36-39
Author(s):  
Lei Cao ◽  
Ariana Hall ◽  
Selcuk Koyuncu
Keyword(s):  
Short Proof ◽  
Convex Polytopes ◽  
Short Note ◽  
Convex Polytope ◽  
Extreme Points ◽  
Alternative Proof ◽  
Stochastic Matrices ◽  
Doubly Stochastic ◽  
Birkhoff's Theorem ◽  
Birkhoff’S Theorem

AbstractWe give a short proof of Mirsky’s result regarding the extreme points of the convex polytope of doubly substochastic matrices via Birkhoff’s Theorem and the doubly stochastic completion of doubly sub-stochastic matrices. In addition, we give an alternative proof of the extreme points of the convex polytopes of symmetric doubly substochastic matrices via its corresponding loopy graphs.

scholarly journals Total edge irregularity strength of (n,t)-kite graph

2018 ◽  
Vol 1008 ◽  
pp. 012049 ◽  
Author(s):  
Tri Winarsih ◽  
Diari Indriati
Keyword(s):  
Irregularity Strength ◽  
Total Edge Irregularity Strength

Polytopes with an Axis Of Symmetry

1970 ◽  
Vol 22 (2) ◽  
pp. 265-287 ◽  
Author(s):  
P. McMullen ◽  
G. C. Shephard
Keyword(s):  
Symmetry Group ◽  
Linear Subspace ◽  
Convex Polytopes ◽  
Convex Polytope ◽  
Simple Manner ◽  
Gale Transform ◽  
Enumeration Problems ◽  
Axis Of Symmetry ◽  
Axes Of Symmetry ◽  
Gale Diagrams

During the last few years, Branko Grünbaum, Micha Perles, and others have made extensive use of Gale transforms and Gale diagrams in investigating the properties of convex polytopes. Up to the present, this technique has been applied almost entirely in connection with combinatorial and enumeration problems. In this paper we begin by showing that Gale transforms are also useful in investigating properties of an essentially metrical nature, namely the symmetries of a convex polytope. Our main result here (Theorem (10)) is that, in a manner that will be made precise later, the symmetry group of a polytope can be represented faithfully by the symmetry group of a Gale transform of its vertices. If a d-polytope P ⊂ Ed has an axis of symmetry A (that is, A is a linear subspace of Ed such that the reflection in A is a symmetry of P), then it is called axi-symmetric. Using Gale transforms we are able to determine, in a simple manner, the possible numbers and dimensions of axes of symmetry of axi-symmetric polytopes.

Sign in / Sign up

Export Citation Format

Share Document