Results 31 to 40 of about 5,368 (184)
Odd Harmonious Labelings of Cyclic Snakes
International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks, 2013 In [8] Liang and Bai have shown that the kC4 − snake graph is an odd harmonious graph for each k ≥ 1. In this paper we generalize this result on cycles by showing that the kCn − snake with string 1,1,…,1 when n ≡ 0 (mod 4) are odd harmonious graph.
openaire +1 more source
Odd harmonious labeling of some cycle related graphs
Proyecciones (Antofagasta), 2017 A graph G(p, q) is said to be odd harmonious if there exists an in-jection f : V(G)→ {0,1, 2, ..., 2q — 1} such that the induced function f * : E(G) → {1, 3, ... 2q — 1} defined by f * (uv) = f (u) + f (v) is a bijection. A graph that admits odd harmonious labeling is called odd harmonious graph.
Jeyanthi, P., Philo, S.
openaire +3 more sources
On cordial labeling of hypertrees
, 2019 Let $f:V\rightarrow\mathbb{Z}_k$ be a vertex labeling of a hypergraph $H=(V,E)$. This labeling induces an~edge labeling of $H$ defined by $f(e)=\sum_{v\in e}f(v)$, where the sum is taken modulo $k$.
Tuczyński, Michał +2 more
core +1 more source
(Di)graph products, labelings and related results [PDF]
, 2017 Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them.
López Masip, Susana-Clara
core +4 more sources
An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles
, 2010 In 1991, Gnanajothi [4] proved that the path graph P_n with n vertex and n-1 edge is odd graceful, and the cycle graph C_m with m vertex and m edges is odd graceful if and only if m even, she proved the cycle graph is not graceful if m odd. In this paper,
Moussa, M. Ibrahim
core +2 more sources
Odd harmonious labeling on squid graph and double squid graph
Journal of Physics: Conference Series, 2020 AbstractAn injective functionffrom set of vertices in graphGto a set of {0,1,…,|E| − 1} is called an odd harmonious labeling if the functionfinduced the edge functionf* from the set of edges ofGto a set of odd positive integer number {1,3,5,…,2|E| − 1} withf*(xy) =f(x) +f(y) for every edgexyinE.Graph that has an odd harmonious labeling is called odd ...
F Febriana, K A Sugeng
openaire +1 more source
Auto‐Routing Fluidic Printed Circuit Boards
Advanced Robotics Research, EarlyView.This work introduces (STREAM) software tool for routing efficiently advanced macrofluidics, an open‐source software tool for automating the design of 3D‐printable fluidic circuit boards. STREAM streamlines tube routing and layout, enabling the rapid fabrication of fluidic networks for soft robotics, lab‐on‐a‐chip devices, microfluidics, and biohybrid ...
Savita V. Kendre +3 more
wiley +1 more source
, 2020 A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints, all induced ...
Dantas, Simone +2 more
core +2 more sources
Advanced Robotics Research, EarlyView.This study explores how information processing is distributed between brains and bodies through a codesign approach. Using the “backpropagation through soft body” framework, brain–body coupling agents are developed and analyzed across several tasks in which output is generated through the agents’ physical dynamics.
Hiroki Tomioka +3 more
wiley +1 more source
Roman Domination in Complementary Prism Graphs [PDF]
, 2012 A Roman domination function on a complementary prism graph GGc is a function f : V [ V c ! {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number R(GGc) of a graph G = (V,E) is the minimum of Px2V [V c f(x)
Chaitra, V., Chaluvaraju, B.
core +2 more sources