Total irregularity strength of disjoint union of isomorphic copies of generalized Petersen graph

2017 ◽  
Vol 09 (06) ◽  
pp. 1750071
Author(s):  
Muhammad Naeem ◽  
Muhammad Kamran Siddiqui
Keyword(s):  
Disjoint Union ◽  
Petersen Graph ◽  
Generalized Petersen Graph ◽  
Irregularity Strength

Let [Formula: see text] be a graph. A total labeling [Formula: see text] is called totally irregular total [Formula: see text]-labeling of [Formula: see text] if every two distinct vertices [Formula: see text] and [Formula: see text] in [Formula: see text] satisfy [Formula: see text] and every two distinct edges [Formula: see text] and [Formula: see text] in [Formula: see text] satisfy [Formula: see text] where [Formula: see text] and [Formula: see text] The minimum [Formula: see text] for which a graph [Formula: see text] has a totally irregular total [Formula: see text]-labeling is called the total irregularity strength of [Formula: see text], denoted by [Formula: see text] In this paper, we determined the total irregularity strength of disjoint union of [Formula: see text] isomorphic copies of generalized Petersen graph.

scholarly journals Edge Irregular Reflexive Labeling for Disjoint Union of Generalized Petersen Graph

Mathematics ◽  
2018 ◽  
Vol 6 (12) ◽  
pp. 304 ◽  
Author(s):  
Juan Guirao ◽  
Sarfraz Ahmad ◽  
Muhammad Siddiqui ◽  
Muhammad Ibrahim
Keyword(s):  
Disjoint Union ◽  
Graph Labeling ◽  
Petersen Graph ◽  
Generalized Petersen Graph ◽  
Whole Numbers ◽  
Labeled Graph ◽  
Edge Strength ◽  
Correct Estimation ◽  
Edge Labeling

A graph labeling is the task of integers, generally spoken to by whole numbers, to the edges or vertices, or both of a graph. Formally, given a graph G = ( V , E ) a vertex labeling is a capacity from V to an arrangement of integers. A graph with such a capacity characterized is known as a vertex-labeled graph. Similarly, an edge labeling is an element of E to an arrangement of labels. For this situation, the graph is called an edge-labeled graph. We examine an edge irregular reflexive k-labeling for the disjoint association of the cycle related graphs and decide the correct estimation of the reflexive edge strength for the disjoint association of s isomorphic duplicates of the cycle related graphs to be specific Generalized Peterson graphs.

The Generalized Connectivity of Generalized Petersen Graph

2021 ◽  
Author(s):  
Yuan Si ◽  
Ping Li ◽  
Yuzhi Xiao ◽  
Jinxia Liang
Keyword(s):  
Steiner Trees ◽  
Petersen Graph ◽  
Generalized Petersen Graph ◽  
Edge Disjoint ◽  
Generalized Connectivity ◽  
Vertex Set

For a vertex set [Formula: see text] of [Formula: see text], we use [Formula: see text] to denote the maximum number of edge-disjoint Steiner trees of [Formula: see text] such that any two of such trees intersect in [Formula: see text]. The generalized [Formula: see text]-connectivity of [Formula: see text] is defined as [Formula: see text]. We get that for any generalized Petersen graph [Formula: see text] with [Formula: see text], [Formula: see text] when [Formula: see text]. We give the values of [Formula: see text] for Petersen graph [Formula: see text], where [Formula: see text], and the values of [Formula: see text] for generalized Petersen graph [Formula: see text], where [Formula: see text] and [Formula: see text].

On entire face irregularity strength of disjoint union of plane graphs

2017 ◽  
Vol 307 ◽  
pp. 232-238 ◽  
Author(s):  
Martin Bača ◽  
Marcela Lascsáková ◽  
Maria Naseem ◽  
Andrea Semaničová-Feňovčíková
Keyword(s):  
Disjoint Union ◽  
Plane Graphs ◽  
Irregularity Strength

scholarly journals Total Edge Irregularity Strength of the Disjoint Union of Helm Graphs

2013 ◽  
Vol 45 (2) ◽  
pp. 163-171 ◽  
Author(s):  
Muhammad Kamran Siddiqui ◽  
◽  
Nurdin Nurdin ◽  
Edy Tri Baskoro ◽  
◽  
...  
Keyword(s):  
Disjoint Union ◽  
Irregularity Strength ◽  
Total Edge Irregularity Strength

scholarly journals The K -Size Edge Metric Dimension of Graphs

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Tanveer Iqbal ◽  
Muhammad Naeem Azhar ◽  
Syed Ahtsham Ul Haq Bokhary
Keyword(s):  
Bipartite Graph ◽  
Connected Graph ◽  
Complete Bipartite Graph ◽  
Petersen Graph ◽  
Metric Dimension ◽  
Resolving Set ◽  
Generalized Petersen Graph

In this paper, a new concept k -size edge resolving set for a connected graph G in the context of resolvability of graphs is defined. Some properties and realizable results on k -size edge resolvability of graphs are studied. The existence of this new parameter in different graphs is investigated, and the k -size edge metric dimension of path, cycle, and complete bipartite graph is computed. It is shown that these families have unbounded k -size edge metric dimension. Furthermore, the k-size edge metric dimension of the graphs Pm □ Pn, Pm □ Cn for m, n ≥ 3 and the generalized Petersen graph is determined. It is shown that these families of graphs have constant k -size edge metric dimension.

Total Vertex Irregularity Strength of Disjoint Union of Ladder Rung Graph and Disjoint Union of Domino Graph

2020 ◽  
Vol 6 (1) ◽  
pp. 47-51
Author(s):  
Nugroho Arif Sudibyo ◽  
Ardymulya Iswardani ◽  
Yohana Putra Surya Rahmad Hidayat
Keyword(s):  
Disjoint Union ◽  
Graph Labeling ◽  
Irregularity Strength

We investigate a graph labeling called the total vertex irregularity strength (tvs(G)). A tvs(G) is minimum for which graph has a vertex irregular total -labeling. In this paper, we determine the total vertex irregularity strength of disjoint union of ladder rung graph and disjoint union of domino graph.  

scholarly journals Eternal Domination of Generalized Petersen Graph

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Ramy Shaheen ◽  
Ali Kassem
Keyword(s):  
Infinite Series ◽  
Dominating Set ◽  
Domination Number ◽  
Upper Bounds ◽  
Adjacent Vertex ◽  
Petersen Graph ◽  
Generalized Petersen Graph ◽  
Dominating Set Problem

An eternal dominating set of a graph G is a set of guards distributed on the vertices of a dominating set so that each vertex can be occupied by one guard only. These guards can defend any infinite series of attacks; an attack is defended by moving one guard along an edge from its position to the attacked vertex. We consider the “all guards move” of the eternal dominating set problem, in which one guard has to move to the attacked vertex and all the remaining guards are allowed to move to an adjacent vertex or stay in their current positions after each attack in order to form a dominating set on the graph and at each step can be moved after each attack. The “all guards move model” is called the m -eternal domination model. The size of the smallest m -eternal dominating set is called the m -eternal domination number and is denoted by γ m ∞ G . In this paper, we find γ m ∞ P n , 1 and γ m ∞ P n , 3 for n ≡ 0   mod   4 . We also find upper bounds for γ m ∞ P n , 2 and γ m ∞ P n , 3 when n is arbitrary.

scholarly journals On irregularity strength of disjoint union of friendship graphs

2013 ◽  
Vol 1 (2) ◽  
pp. 100-108 ◽  
Author(s):  
Ali Ahmad ◽  
◽  
Martin Baca ◽  
Muhammad Numan ◽  
◽  
...  
Keyword(s):  
Disjoint Union ◽  
Irregularity Strength
Sign in / Sign up

Export Citation Format

Share Document