scholarly journals 3-Total Edge Product Cordial Labeling for Stellation of Square Grid Graph

2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Rizwan Ullah ◽  
Gul Rahmat ◽  
Muhammad Numan ◽  
Kraidi Anoh Yannick ◽  
Adnan Aslam
Keyword(s):  
Simple Graph ◽  
Grid Graph ◽  
Square Grid ◽  
Vertex Set ◽  
Edge Labeling

Let G be a simple graph with vertex set V G and edge set E G . An edge labeling δ : E G ⟶ 0,1 , … , p − 1 , where p is an integer, 1 ≤ p ≤ E G , induces a vertex labeling δ ∗ : V H ⟶ 0,1 , … , p − 1 defined by δ ∗ v = δ e 1 δ e 2 ⋅ δ e n mod p , where e 1 , e 2 , … , e n are edges incident to v . The labeling δ is said to be p -total edge product cordial (TEPC) labeling of G if e δ i + v δ ∗ i − e δ j + v δ ∗ j ≤ 1 for every i , j , 0 ≤ i ≤ j ≤ p − 1 , where e δ i and v δ ∗ i are numbers of edges and vertices labeled with integer i , respectively. In this paper, we have proved that the stellation of square grid graph admits a 3-total edge product cordial labeling.

On Edge-Balance Index Sets of the Graph CnxP6(n=3,4,5mod6)

2011 ◽  
Vol 339 ◽  
pp. 662-665
Author(s):  
Yu Rong Ji ◽  
Ai Jun Li ◽  
Jing Jing Yao
Keyword(s):  
Simple Graph ◽  
Index Sets ◽  
Vertex Set ◽  
Binary Edge ◽  
Balance Index ◽  
Edge Labeling

Let G be a simple graph with vertex set V(G) and edge set E(G), and let Z2 = {0,1}. For a given binary edge labeling f :E(G)→Z2 , the edge labeling f induces a partial vertex labeling f*:V(G)→Z2 such that f*(v) =1(0) iff the number of 1-edges (0-edges) is strictly greater than the number of 0-edges (1-edges) incident to v , otherwise f*(v) is idefined. For i∈Z2 , let v(i)=card{v∈V(G): f*(v) =i} and e(i) = card{e∈E(G) : f (e)=i}. The edge-balance index sets of a graph G,EBI(G), is defined as {|v(0) −v(1) |: the edge labeling f satisfies |e(0)−e(1) |≤1}.In this paper, we completely determine the edge-balance CnxP 6(n=3,4,5mod6).

On Edge-Balance Index Sets of the Graph Cn×Pb(n=0,1,2mod6)

2011 ◽  
Vol 143-144 ◽  
pp. 750-754
Author(s):  
Yu Rong Ji ◽  
Ying Fang Zhang ◽  
Yu Ge Zheng
Keyword(s):  
Simple Graph ◽  
Index Sets ◽  
Vertex Set ◽  
Binary Edge ◽  
Balance Index ◽  
Edge Labeling

Let G be a simple graph with vertex set V(G) and edge set E(G), and let Z2=(0,1) For a given binary edge labeling f:E(G)→Z2,the edge labeling f induces a partial vertex labeling f*:V(G)→Z2 such that f*(v)=1(0) iff the number of 1-edges (0-edges) is strictly greater than the number of 0-edges (1-edges) incident to , otherwise f*(v) is undefined. For i∈Z2, let v(i)=card(e∈V(G):f*(v)=i) and e(i)=card(e∈E(G):f(e)=i). The edge-balance index sets of a graph G,EBI(G), is defined as {|v(0)-v(1): the edge labeling f satisfies } . In this paper, we completely determine the edge-balance index |e(0)-e(1)|≤1 sets of the graph Cn×Pb(n=0,1,2 mod 6)

scholarly journals Resistance Distance and Kirchhoff Index of Graphs with Pockets

2018 ◽  
Author(s):  
Qun Liu ◽  
Jiabao Liu
Keyword(s):  
Closed Form ◽  
Simple Graph ◽  
Kirchhoff Index ◽  
Resistance Distance ◽  
Vertex Set

Let G[F,Vk, Huv] be the graph with k pockets, where F is a simple graph of order n ≥ 1,Vk= {v1,v2,··· ,vk} is a subset of the vertex set of F and Hvis a simple graph of order m ≥ 2,v is a specified vertex of Hv. Also let G[F,Ek, Huv] be the graph with k edge pockets, where F is a simple graph of order n ≥ 2, Ek= {e1,e2,···ek} is a subset of the edge set of F and Huvis a simple graph of order m ≥ 3, uv is a specified edge of Huvsuch that Huv− u is isomorphic to Huv− v. In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of G[F,Vk, Hv] and G[F,Ek, Huv] in terms of the resistance distance and Kirchhoff index F, Hv and F, Huv, respectively.

scholarly journals On k-rainbow domination in middle graphs

2021 ◽  
Author(s):  
Kijung Kim
Keyword(s):  
Minimum Weight ◽  
Domination Number ◽  
Simple Graph ◽  
Upper And Lower Bounds ◽  
Matching Number ◽  
Domatic Number ◽  
Rainbow Domination ◽  
Vertex Set ◽  
Middle Graph ◽  
Dominating Function

Let $G$ be a finite simple graph with vertex set $V(G)$ and edge set $E(G)$. A function $f : V(G) \rightarrow \mathcal{P}(\{1, 2, \dotsc, k\})$ is a \textit{$k$-rainbow dominating function} on $G$ if for each vertex $v \in V(G)$ for which $f(v)= \emptyset$, it holds that $\bigcup_{u \in N(v)}f(u) = \{1, 2, \dotsc, k\}$. The weight of a $k$-rainbow dominating function is the value $\sum_{v \in V(G)}|f(v)|$. The \textit{$k$-rainbow domination number} $\gamma_{rk}(G)$ is the minimum weight of a $k$-rainbow dominating function on $G$. In this paper, we initiate the study of $k$-rainbow domination numbers in middle graphs. We define the concept of a middle $k$-rainbow dominating function, obtain some bounds related to it and determine the middle $3$-rainbow domination number of some classes of graphs. We also provide upper and lower bounds for the middle $3$-rainbow domination number of trees in terms of the matching number. In addition, we determine the $3$-rainbow domatic number for the middle graph of paths and cycles.

scholarly journals On Total Vertex Irregularity Strength of Hexagonal Cluster Graphs

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Nurdin Hinding ◽  
Hye Kyung Kim ◽  
Nurtiti Sunusi ◽  
Riskawati Mise
Keyword(s):  
Lower Bound ◽  
Positive Integer ◽  
Simple Graph ◽  
Vertex Set ◽  
Cluster Graph ◽  
Cluster Graphs ◽  
Irregularity Strength

For a simple graph G with a vertex set V G and an edge set E G , a labeling f : V G ∪ ​ E G ⟶ 1,2 , ⋯ , k is called a vertex irregular total k − labeling of G if for any two different vertices x and y in V G we have w t x ≠ w t y where w t x = f x + ∑ u ∈ V G f x u . The smallest positive integer k such that G has a vertex irregular total k − labeling is called the total vertex irregularity strength of G , denoted by tvs G . The lower bound of tvs G for any graph G have been found by Baca et. al. In this paper, we determined the exact value of the total vertex irregularity strength of the hexagonal cluster graph on n cluster for n ≥ 2 . Moreover, we show that the total vertex irregularity strength of the hexagonal cluster graph on n cluster is 3 n 2 + 1 / 2 .

Walk-set induced connectedness in digital spaces

2017 ◽  
Vol 33 (2) ◽  
pp. 247-256
Author(s):  
JOSEF SLAPAL ◽  
Keyword(s):  
Jordan Curve ◽  
Digital Images ◽  
Simple Graph ◽  
Jordan Curve Theorem ◽  
Strong Product ◽  
Digital Plane ◽  
Vertex Set ◽  
Product Of Graphs ◽  
Digital Spaces

In an undirected simple graph, we define connectedness induced by a set of walks of the same lengths. We show that the connectedness is preserved by the strong product of graphs with walk sets. This result is used to introduce a graph on the vertex set Z2 with sets of walks that is obtained as the strong product of a pair of copies of a graph on the vertex set Z with certain walk sets. It is proved that each of the walk sets in the graph introduced induces connectedness on Z2 that satisfies a digital analogue of the Jordan curve theorem. It follows that the graph with any of the walk sets provides a convenient structure on the digital plane Z2 for the study of digital images.

On the edge irregularity strength of corona product of graphs with cycle

2020 ◽  
Vol 12 (06) ◽  
pp. 2050083
Author(s):  
I. Tarawneh ◽  
R. Hasni ◽  
A. Ahmad ◽  
G. C. Lau ◽  
S. M. Lee
Keyword(s):  
Simple Graph ◽  
Vertex Set ◽  
Product Of Graphs ◽  
Corona Product ◽  
Irregularity Strength

Let [Formula: see text] be a simple graph with vertex set [Formula: see text] and edge set [Formula: see text], respectively. An edge irregular [Formula: see text]-labeling of [Formula: see text] is a labeling of [Formula: see text] with labels from the set [Formula: see text] in such a way that for any two different edges [Formula: see text] and [Formula: see text], their weights [Formula: see text] and [Formula: see text] are distinct. The weight of an edge [Formula: see text] in [Formula: see text] is the sum of the labels of the end vertices [Formula: see text] and [Formula: see text]. The minimum [Formula: see text] for which the graph [Formula: see text] has an edge irregular [Formula: see text]-labeling is called the edge irregularity strength of [Formula: see text], denoted by [Formula: see text]. In this paper, we determine the exact value of edge irregularity strength of corona product of graphs with cycle.

scholarly journals Properties of the characteristic polynomials and spectrum of Pn and Cn

2016 ◽  
Vol 5 (2) ◽  
pp. 132
Author(s):  
Essam El Seidy ◽  
Salah Eldin Hussein ◽  
Atef Mohamed
Keyword(s):  
Adjacency Matrix ◽  
Laplacian Matrix ◽  
Simple Graph ◽  
Characteristic Polynomials ◽  
Signless Laplacian Matrix ◽  
Path Graph ◽  
Signless Laplacian ◽  
Vertex Set ◽  
Cycle Graph

We consider a finite undirected and connected simple graph  with vertex set  and edge set .We calculated the general formulas of the spectra of a cycle graph and path graph. In this discussion we are interested in the adjacency matrix, Laplacian matrix, signless Laplacian matrix, normalized Laplacian matrix, and seidel adjacency matrix.

When the annihilator-ideal graph is planar or complete bipartite graph

2019 ◽  
Vol 12 (02) ◽  
pp. 1950024
Author(s):  
M. J. Nikmehr ◽  
S. M. Hosseini
Keyword(s):  
Commutative Ring ◽  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Simple Graph ◽  
Annihilator Ideal ◽  
Vertex Set

Let [Formula: see text] be a commutative ring with identity and [Formula: see text] be the set of ideals of [Formula: see text] with nonzero annihilator. The annihilator-ideal graph of [Formula: see text], denoted by [Formula: see text], is a simple graph with the vertex set [Formula: see text], and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]. In this paper, we present some results on the bipartite, complete bipartite, outer planar and unicyclic of the annihilator-ideal graphs of a commutative ring. Among other results, bipartite annihilator-ideal graphs of rings are characterized. Also, we investigate planarity of the annihilator-ideal graph and classify rings whose annihilator-ideal graph is planar.

Sign in / Sign up

Export Citation Format

Share Document