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
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
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
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
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
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
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
Computing symmetry groups of polyhedra [PDF]
, 2014 Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial structure of a ...
Bremner, David +4 more
core +2 more sources
One-way quantum computing with arbitrarily large time-frequency continuous-variable cluster states from a single optical parametric oscillator [PDF]
, 2016 One-way quantum computing is experimentally appealing because it requires only local measurements on an entangled resource called a cluster state. Record-size, but non-universal, continuous-variable cluster states were recently demonstrated separately in
Alexander, Rafael N. +5 more
core +2 more sources
Properly coloured copies and rainbow copies of large graphs with small maximum degree [PDF]
, 2010 Let G be a graph on n vertices with maximum degree D. We use the Lov\'asz local lemma to show the following two results about colourings c of the edges of the complete graph K_n. If for each vertex v of K_n the colouring c assigns each colour to at most (
Böttcher, Julia +2 more
core +1 more source