Results 11 to 20 of about 11,012 (251)
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
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
FACE-ing the future of single-pixel complex-field microscopy beyond the visible spectrum [PDF]
Light: Science & ApplicationsSingle-pixel imaging (SPI) has long been recognized for its potential in spectral regions where conventional imaging sensors fall short, such as the near-infrared spectrum.
Stefan G. Stanciu, Edoardo Charbon
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 total vertex irregularity strength of comb product of two cycles and two stars
Indonesian Journal of Combinatorics, 2020 Let G = (V(G),E(G)) be a graph and k be a positive integer. A total k-labeling of G is a map f : V ∪ E → {1,2,3,...,k}. The vertex weight v under the labeling f is denoted by w_f(v) and defined by w_f(v) = f(v) + \sum_{uv \in{E(G)}} {f(uv)}.
Rismawati Ramdani
doaj +1 more source
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
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
DIMENSI METRIK KETETANGGAAN LOKAL GRAF HASIL OPERASI k-COMB
Contemporary Mathematics and Applications (ConMathA), 2019 Research on the local adjacency metric dimension has not been found in all operations of the graph, one of them is comb product graph. The purpose of this research was to determine the local adjacency metric dimension of k-comb product graph and level ...
Fryda Arum Pratama +2 more
doaj +1 more source
XUV frequency comb production with an astigmatism-compensated enhancement cavity
Optics Express, 2021 We have developed an extreme ultraviolet (XUV) frequency comb for performing ultra-high precision spectroscopy on the many XUV transitions found in highly charged ions (HCI). Femtosecond pulses from a 100 MHz phase-stabilized near-infrared frequency comb are amplified and then fed into a femtosecond enhancement cavity (fsEC) inside an ultra-high vacuum
J. Nauta +8 more
openaire +3 more sources
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 +2 more
doaj +1 more source