Results 71 to 80 of about 60,649 (158)
Edge-graceful usual fan graphs [PDF]
arXivA graph $G$ with $p$ vertices and $q$ edges is said to be edge-graceful if its edges can be labeled from $1$ through $q$, in such a way that the labels induced on the vertices by adding over the labels of incident edges modulo $p$ are distinct. A known result under this topic is Lo's Theorem, which states that if a graph $G$ with $p$ vertices and $q ...
arxiv
An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles
, 2010 Ibrahim Moussa M
openalex +1 more source
Open-source deep-learning software for bioimage segmentation. [PDF]
Mol Biol Cell, 2021 Lucas AM +5 more
europepmc +1 more source
Decompositions of complete multipartite graphs via generalized graceful labelings
, 2012 Anna Miriam Benini, Anita Pasotti
openalex +2 more sources
Odd - Even Graceful Labeling for Different Paths using Padavon Sequence
, 2014 S. UmaMaheswari
openalex +1 more source
Graceful labeling of arrow graphs and double arrow graphs
, 2015 V. J. Kaneria, M M Jariya, H. M. Makadia
openalex +2 more sources
Automatic Passenger Counting on the Edge via Unsupervised Clustering. [PDF]
Sensors (Basel), 2023 Delzanno G +6 more
europepmc +1 more source
Graceful coloring is computationally hard [PDF]
arXivGiven a (proper) vertex coloring $f$ of a graph $G$, say $f\colon V(G)\to \mathbb{N}$, the difference edge labelling induced by $f$ is a function $h\colon E(G)\to \mathbb{N}$ defined as $h(uv)=|f(u)-f(v)|$ for every edge $uv$ of $G$. A graceful coloring of $G$ is a vertex coloring $f$ of $G$ such that the difference edge labelling $h$ induced by $f$ is
arxiv
On the Oberwolfach problem for single-flip 2-factors via graceful labelings [PDF]
, 2022 Andrea C. Burgess +2 more
openalex +1 more source
Implementing High-Reliability Organization Principles at Biological Diagnostic Laboratories: Case Study at National Institute of Health, Islamabad. [PDF]
Appl Biosaf, 2022 Tamim S +12 more
europepmc +1 more source