Results 1 to 10 of about 1,855 (182)
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 +4 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 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
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
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
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
Bound of Distance Domination Number of Graph and Edge Comb Product Graph
Journal of Physics: Conference Series, 2017 Let G = (V, E) be a simple, nontrivial, finite, connected and undirected graph. For an integer 1 ≤ k ≤ diam(G), a distance k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V (G)\S is at distance at most k from some vertex of S. The k-domination number, denoted by γ k (G), of G is the minimum cardinality of a
Ika Hesti Agustin
exaly +2 more sources
Distance Domination Number of Graphs Resulting from Edge Comb Product
Journal of Physics: Conference Series, 2018 Let G be a simple, finite and connected graph with a vertex-set V (G) and an edge-set E(G). For an integer 1 ≤ k ≤ diam (G), a distance k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V (G)\S is at distance at most k from some vertex of S.
null Slamin +2 more
exaly +2 more sources
The Edge Metric Dimension of the Comb Product of a Cycle and a Graph with a Dominant Vertex
Electronic Journal of Graph Theory and ApplicationsIn this paper, we determine the edge metric dimension of the comb product of a cycle graph and a simple graph containing a dominant vertex. This result generalizes previous findings on the edge metric dimension of the comb product of a cycle and a ...
Abdilla Nurul Azisah Mn +3 more
doaj +3 more sources
On the (Strong) Rainbow Vertex Connection of Graphs Resulting from Edge Comb Product
Journal of Physics: Conference Series, 2018 null Dafik +2 more
exaly +2 more sources