Results 1 to 10 of about 30,403 (170)
-super antimagic total labeling of comb product of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2019 Let and be two simple, nontrivial and undirected graphs. Let be a vertex of , the comb product between and , denoted by , is a graph obtained by taking one copy of and copies of and grafting the th copy of at the vertex to the th vertex of .
Ika Hesti Agustin +2 more
doaj +6 more sources
The geodetic domination number of comb product graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2020 A subset S of vertices in graph G is called a geodetic set if every vertex in V(G) \ S lies on a shortest path between two vertices in S. A subset S of vertices in G is called a dominating set if every vertex in V(G) \ S is adjacent to a vertex in S ...
Dimas Agus Fahrudin, Suhadi Wido Saputro
doaj +3 more sources
Rainbow connection number of comb product of graphs
Electronic Journal of Graph Theory and Applications, 2022 An edge-colored graph G is called a rainbow connected if any two vertices are connected by a path whose edges have distinct colors. Such a path is called a rainbow path.
Dinny Fitriani +2 more
doaj +3 more sources
On locating-dominating number of comb product graphs
Indonesian Journal of Combinatorics, 2020 We consider a set D ⊆ V(G) which dominate G and for every two distinct vertices x, y ∈ V(G) \ D, the open neighborhood of x and y in D are different. The minimum cardinality of D is called the locating-dominating number of G.
Aswan Anggun Pribadi +1 more
doaj +3 more sources
Fractional Local Metric Dimension of Comb Product Graphs
مجلة بغداد للعلوم, 2020 The local resolving neighborhood of a pair of vertices for and is if there is a vertex in a connected graph where the distance from to is not equal to the distance from to , or defined by .
Siti Aisyah +2 more
doaj +2 more sources
On the set chromatic number of the join and comb product of graphs [PDF]
Journal of Physics: Conference Series, 2020 Abstract A vertex coloring c : V(G) → ℕ of a non-trivial connected graph G is called a set coloring if NC(u) ≠ NC(v) for any pair of adjacent vertices u and v. Here, NC(x) denotes the set of colors assigned to vertices adjacent to x. The set chromatic number of G, denoted by χs (G), is defined as the fewest number of ...
B C L Felipe +2 more
exaly +2 more sources
ZONAL LABELING OF EDGE COMB PRODUCT OF GRAPHS
Jurnal Matematika UNANDGiven a plane graph $G=(V,E)$. A zonal labeling of graph $G$ is defined as an assignment of the two nonzero elements of the ring $\mathbb{Z}_3$, which are $1$ and $2$, to the vertices of $G$ such that the sum of the labels of the vertices on the border ...
Junita Christine Soewongsono +3 more
doaj +2 more sources
Computing the total H-irregularity strength of edge comb product of graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 A simple undirected graph = (V Γ, EΓ) admits an H-covering if every edge in E belongs to at least one subgraph of that is isomorphic to a graph H. For any graph admitting H-covering, a total labelling β : VΓ ∪EΓ→{1, 2, …, p} is called an H-irregular ...
Wahyujati Mohamad Fahruli, Susanti Yeni
doaj +3 more sources
On the Rainbow and Strong Rainbow Coloring of Comb Product Graphs [PDF]
Acta Mechanica Slovaca, 2018 Let G=(V,E) be a simple, nontrivial, finite, connected and undirected graph. Let c be a coloring c: E(G)g{1,2,…,k}, kdN. A path of the edges of a colored graph is said to be a rainbow path if no two edges on the path have the same color but the adjacent edges may be colored by the same colors.
exaly +2 more sources
On metric dimension of edge comb product of vertex-transitive graphs [PDF]
Transactions on CombinatoricsSuppose finite graph $G$ is simple, undirected and connected. If $W$ is an ordered set of the vertices such that $|W| = k$, the representation of a vertex $v$ is an ordered $k$-tuple consisting distances of vertex $v$ with every vertices in $W$. The set $
Tita Maryati +3 more
doaj +2 more sources