Results 31 to 40 of about 9,546 (165)
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
Odd harmonious labeling of Sn (m, r) graph
Journal of Physics: Conference Series, 2021 Abstract A graph labeling is an assignment of integers to vertices or edges of a graph subject to certain conditions. There are various kinds of graph labeling, one of them is an odd harmonious labeling. An odd harmonious labeling f of a graph G on q edges is an injective function f from the set of vertices of G to the set {0,1,2,…,2q ...
E A Pramesti, null Purwanto
openaire +2 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
On the edge-balanced index sets of product graphs [PDF]
, 2011 We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_n\times K_2$.
Krop, Elliot +2 more
core +2 more sources
A Note on 1-Edge Balance Index Set [PDF]
, 2012 A graph labeling is an assignment of integers to the vertices or edges or both, subject to certain conditions. Varieties of graph labeling have been investigated by many authors [2], [3] [5] and they serve as useful models for broad range of ...
Chandrashekar Adiga, +2 more
core +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
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
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
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
The Anatomical Record, EarlyView.Abstract Basking sharks, Cetorhinus maximus (Gunnerus, Brugden [Squalus maximus], Det Kongelige Norske Videnskabers Selskabs Skrifter, 1765, vol. 3, pp. 33–49), feed by gaping their mouths and gill slits, greatly reorienting their cranial skeletons to filter food from water.
Tairan Li +12 more
wiley +1 more source