Results 11 to 20 of about 1,855 (182)
Odd Harmonious Labeling of Pn ⊵ C4 and Pn ⊵ D2(C4)
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
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
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
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
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
The 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
Transducers convert physical signals into electrical and optical representations, yet each mechanism is bounded by intrinsic trade‐offs across bandwidth, sensitivity, speed, and energy. This review maps transduction mechanisms across physical scale and frequency, showing how heterogeneous integration and multiphysics co‐design transform isolated ...
Aolei Xu +8 more
wiley +1 more source
On the RACN of the comb product of the cycle C_3 with path P_n and broom Br_(n,m)
The combination of rainbow coloring and anti-magic labeling is known as Rainbow Antimagic Coloring (RAC). The Rainbow Antimagic Connection Number (RACN) of a graph G is the smallest number of colors induced by all edge weights under an antimagic labeling,
Brian Juned Septory +2 more
doaj +1 more source
Flexible Chitosan‐glycerol sensor integrated with porous laser‐induced graphene (LIG) electrodes enable room‐temperature chemiresistive detection of ammonia (NH3) and proof‐of‐concept detection of fish spoilage. ABSTRACT We report a metal‐free sensor platform combining laser induced graphene (LIG) electrodes with drop‐deposited, glycerol‐plasticized ...
Mintesinot Tamiru Mengistu +9 more
wiley +1 more source
Local edge antimagic chromatic number of comb products involving path graph
Let G = (V, E) be a graph with n vertices and no isolated vertices. A local edge antimagic labeling of G is a bijection f : V(G)→{1, 2, …, n} such that the weights of any two adjacent edges in G are distinct, where the weight of an edge in G is defined ...
Ivana Joice Chandra, Denny Riama Silaban
doaj +1 more source

