Results 11 to 20 of about 418 (113)
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
Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Hasil Operasi Comb Graf Bintang
Contemporary Mathematics and Applications (ConMathA), 2022 Let G(V,E) is a simple graph and connected where V(G) is vertex set and E(G) is edge set. An inclusive local irregularity vertex coloring is defined by a mapping l:V(G) í {1,2,..., k} as vertex labeling and wi : V(G) í N is function of inclusive local ...
Arika Indah Kristiana +2 more
doaj +1 more source
Local Edge Antimagic Coloring of Comb Product of Graphs [PDF]
Journal of Physics: Conference Series, 2018 IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018) 012038 ; All graph in this paper are ¯nite, simple and connected graph. Let G(V; E) be a graph of vertex set V and edge set E. A bijection f : V (G) ¡! f1; 2; 3; :::; jV (G)jg is called a local edge antimagic labeling if for any two adjacent edges e 1 and e 2 , w(e 1 ) 6 = w(e ), where for ...
Agustin, Ika Hesti +5 more
openaire +1 more source
Strongly Multiplicative Labeling of Diamond Graph, Generalized Petersen Graph, and Some Other Graphs
Journal of Mathematics, 2022 A finite, simple graph of order k is said to be a strongly multiplicative graph when all vertices of the graph are labeled by positive integers 1,2,3,…,k such that the induced edge labels of the graph, obtained by the product of labels of end vertices of
Sumiya Nasir +5 more
doaj +1 more source
Odd Harmonious Labeling of Pn ⊵ C4 and Pn ⊵ D2(C4)
Indonesian Journal of Combinatorics, 2021 A graph G with q edges is said to be odd harmonious if there exists an injection f:V(G) → ℤ2q so that the induced function f*:E(G)→ {1,3,...,2q-1} defined by f*(uv)=f(u)+f(v) is a bijection.Here we show that graphs constructed by edge comb product of ...
Sabrina Shena Sarasvati +2 more
doaj +1 more source
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 +1 more source
Major Reference Works, Page 290-301., 2021 International Tables for Crystallography is the definitive resource and reference work for crystallography and structural science.
Each of the eight volumes in the series contains articles and tables of data relevant to crystallographic research and to applications of crystallographic methods in all sciences concerned with the ...
John P. Sutter C. Chantler +2 more
wiley +1 more source
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
openaire +1 more source
Journal of Physics: Conference Series, 2017 All graphs in this paper are simple, finite, and undirected graph. Let r be a edges of H. The edge comb product between L and H, denoted by LH, is a graph obtained by taking one copy of L and |E(L)| copies of H and grafting the i-th copy of H at the edges r to the i-th edges of L, we call such a graph as an edge comb product of graph with subgraph as a
null Dafik +3 more
openaire +1 more source
The matching book embedding under some graph operations
Electronic Journal of Graph Theory and ApplicationsThe matching book embedding of a graph G is an embedding of G with the vertices on the spine, and each edge within a single page so that the edges on each page do not intersect and the degree of vertices on each page is at most one.
Zeling Shao, Min Yao, Zhiguo Li
doaj +1 more source