Results 11 to 20 of about 30,403 (170)
On Metric Dimension of Edge Comb Product of Symmetric Graphs
Jurnal Matematika UNANDConsider a finite graph G that is simple, undirected, and connected. Let W be an ordered set of vertices with |W| = k. The representation of a vertex v is defined as an ordered k-tuple that consists of the distances from vertex v to each vertex in W. The
Tita Khalis Maryati +2 more
doaj +2 more sources
The strong 3-rainbow index of edge-comb product of a path and a connected graph
Electronic Journal of Graph Theory and Applications, 2022 Let G be a connected and edge-colored graph of order n, where adjacent edges may be colored the same. A tree in G is a rainbow tree if all of its edges have distinct colors. Let k be an integer with 2 ≤ k ≤ n.
Zata Yumni Awanis +2 more
doaj +2 more sources
On resolving perfect dominating number of comb product of special graphs
Journal of Physics: Conference Series, 2021 Abstract A set of vertices D ⊆ V(G) is the dominating set of graph G if every vertex on graph G is dominated by dominators. The dominating set of D on graph G is a perfect if every point of a graph G is dominated by exactly one vertex on D. For each vertex υ ∈ V (G), the k-vector r(υ| W) is called the metric code or location W, where W =
R Alfarisi
exaly +2 more sources
On resolving efficient domination number of comb product of special graphs
Journal of Physics: Conference Series, 2021 Abstract Let G be a connected, finite, and undirected graph. A vertex set D in G is an efficient dominating set of G if D is an independent set and for each point υ ∈ V(G)-D is adjacent to precisely one vertex d ∈ D. The representation of points υ ∈ V(G) in respect of an ordered set W = {w 1, w 2,…, wk
I M Tirta, R M Prihandini
exaly +2 more sources
On local irregularity vertex coloring of comb product on star graphs
Journal of Physics: Conference Series, 2021 Abstract Let G = (V,E) be a graph with vertex set V and edge set E. The graph G is said to be a local irregular vertex coloring if there is a function f is a called a local irregularity vertex coloring if : (i) l : (V (G)) → {1, 2,…,k} as a vertex irregular k-labeling and w : V(G) → N, for every uv ∈ E(G),w(u) = w(v) where w(u) = Σv∈N(u)
R Adawiyah, Ika Hesti Agustin
exaly +2 more sources
Rainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph
Proceedings of the Indian Academy of Sciences: Mathematical Sciences, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Baca +2 more
exaly +3 more sources
Local edge antimagic chromatic number of comb products involving path graph
Electronic Journal of Graph Theory and ApplicationsLet G = (V, E) be a graph with n vertices and no isolated vertices. A local edge antimagic labeling of G is a bijection f : V(G)→{1, 2, …, n} such that the weights of any two adjacent edges in G are distinct, where the weight of an edge in G is defined ...
Ivana Joice Chandra, Denny Riama Silaban
doaj +2 more sources
ON STAR COLORING OF DEGREE SPLITTING OF COMB PRODUCT GRAPHS [PDF]
Facta Universitatis, Series: Mathematics and Informatics, 2020 A star coloring of a graph G is a proper vertex coloring in which every path on four vertices in G is not bicolored. The star chromatic number χs (G) of G is the least number of colors needed to star color G. Let G = (V,E) be a graph with V = S1 [ S2 [ S3 [ . . .
Subramanian, Ulagammal +1 more
openaire +2 more sources
On the Locating Edge Domination Number of Comb Product of Graphs
Journal of Physics: Conference Series, 2018 I H Agustin, Moh Hasan, R Adawiyah
exaly +2 more sources
Barekeng, 2023 Rainbow vertex-connection number is the minimum colors assignment to the vertices of the graph, such that each vertex is connected by a path whose edges have distinct colors and is denoted by .
Nisky Imansyah Yahya +3 more
doaj +1 more source