Results 21 to 30 of about 30,403 (170)

Local multiset dimension of comb product of tree graphs

AIMS Mathematics, 2023
<abstract> <p>Resolving set has several applications in the fields of science, engineering, and computer science. One application of the resolving set problem includes navigation robots, chemical structures, and supply chain management. Suppose the set $ W = \left\{{s}_{1}, {s}_{2}, \dots , {s}_{k}\right\}\subset V\left(G\right) $, the ...
Ridho Alfarisi, Liliek Susilowati, Dafik
openaire   +2 more sources

Odd Harmonious Labeling of P_n ⊵ C₄ and  P_n ⊵ D₂(C₄)

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, Ikhsanul Halikin, Kristiana Wijaya   +2 more
doaj   +1 more source

On graceful chromatic number of comb product of ladder graph

Journal of Physics: Conference Series, 2021
Abstract Let G be a connected and simple graph. Proper vertex colouring c : V(G) — {1, 2, 3,…, k} where k → 2 that induces a proper edge colouring c’ : E(G) — {1, 2, 3,…, k — 1} define by c’(uv)=|c(u) — c(v)|, where uv in E(G) is called graceful k— colouring.
S Khoirunnisa, null Dafik, A I Kristiana, R Alfarisi, E R Albirri   +4 more
openaire   +1 more source

The total rainbow connection on comb product of cycle and path graphs

IOP Conference Series: Earth and Environmental Science, 2019
I H Agustin, Ridho Alfarisi
exaly   +2 more sources

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, Pasechnik, Dmitrii V., Rehn, Thomas, Schürmann, Achill, Sikiric, Mathieu Dutour   +4 more
core   +2 more sources

On fractional metric dimension of comb product graphs

Statistics, Optimization & Information Computing, 2018
A vertex $z$ in a connected graph $G$ \textit{resolves} two vertices $u$ and $v$ in $G$ if $d_G(u,z)\neq d_G(v,z)$. \ A set of vertices $R_G\{u,v\}$ is a set of all resolving vertices of $u$ and $v$ in $G$. \ For every two distinct vertices $u$ and $v$ in $G$, a \textit{resolving function} $f$ of $G$ is a real function $f:V(G)\rightarrow[0,1]$ such ...
Suhadi Wido Saputro, Andrea Semanicova-Fenovc, Martin Baca, Marcela Lascsakova   +3 more
openaire   +2 more sources

On metric chromatic number of comb product of ladder graph

Journal of Physics: Conference Series, 2021
Abstract All graphs in this paper are connected and nontrivial graph. Let f : V(G) → {1,2,…,k} be a vertex coloring of a graph G where two adjacent vertices may be colored the same color. Consider the color classes Π = {C1, C2,…, Ck}. For a vertex v of G, the representation color of v is the k-vektor r(v | Π) = {d(v, C1),d(v, C
M Y Rohmatulloh, null Slamin, A I Kristiana, null Dafik, R Alfarisi   +4 more
openaire   +1 more source

On Commutative Characterization of Graph Operation with Respect to Metric Dimension

Journal of Mathematical and Fundamental Sciences, 2017
Let G be a connected graph with vertex set V(G) and W={w1, w2, ..., wm} ⊆ V(G). A representation of a vertex v ∈ V(G) with respect to W is an ordered m-tuple r(v|W)=(d(v,w1),d(v,w2),...,d(v,wm)) where d(v,w) is the distance between vertices v and w. The
Liliek Susilowati, Mohammad Imam Utoyo, Slamin   +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, Hasan, Mohammad, Dafik, Dafik, Alfarisi, Ridho, Kristiana, Arika Indah, Prihandini, Rafiantika Megahnia   +5 more
openaire   +1 more source

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., Chen, Moran, Menicucci, Nicolas C., Pfister, Olivier, Sridhar, Niranjan, Wang, Pei   +5 more
core   +2 more sources