Results 51 to 60 of about 919,081 (302)
On Square Sum Labeling of Two Families of Petersen Graphs
Journal of Mathematics, 2022 A labeling on a graph G with n vertices and m edges is called square sum if there exists a bijection f:VG⟶0,1,2,3,…,n−1 such that the function f∗:EG⟶N defined by f∗st=fs2+ft2, for all st∈EG, is injective.
Zhiqiang Zhang +3 more
doaj +1 more source
Graphs with average labellings
Discrete Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matús Harminc, Roman Soták
openaire +2 more sources
Minimal Sum Labeling of Graphs [PDF]
Journal of Discrete Algorithms, 2018 A graph $G$ is called a sum graph if there is a so-called sum labeling of $G$, i.e. an injective function $\ell: V(G) \rightarrow \mathbb{N}$ such that for every $u,v\in V(G)$ it holds that $uv\in E(G)$ if and only if there exists a vertex $w\in V(G)$ such that $\ell(u)+\ell(v) = \ell(w)$. We say that sum labeling $\ell$ is minimal if there is a vertex
Matěj Konečný +5 more
openaire +5 more sources
On Integer Cordial Labeling of Some Families of Graphs
Ratio Mathematica, 2022 An integer cordial labeling of a graph $G(p,q)$ is an injective map $f:V\rightarrow [-\frac{p}{2}...\frac{p}{2}]^*$ or $[-\lfloor{\frac{p}{2}\rfloor}...\lfloor{\frac{p}{2}\rfloor}]$ as $p$ is even or odd, which induces an edge labeling $f^*: E ...
S Sarah Surya, Lian Mathew, Alan Thomas
doaj +1 more source
Super Fibonacci Graceful Labeling of Some Special Class of Graphs [PDF]
, 2011 A Fibonacci graceful labeling and a super Fibonacci graceful labeling on graphs were introduced by Kathiresan and Amutha in ...
Sridevi, R. +2 more
core +1 more source
Discrete Mathematics, 1991 This paper deals with so-called \(d\)-Skolem labelled graphs and \(d\)-hooked Skolem labelled graphs. After quoting and representing main results in terms of \(d\)-Skolem labelled graphs the authors prove a lot of new theorems. Most of them give new classes of \(d\)-Skolem labelled graphs.
Eric Mendelsohn, Nabil Shalaby
openaire +2 more sources
PAIR MEAN CORDIAL LABELING OF HURDLE, KEY, LOTUS, AND NECKLACE GRAPHS
BarekengLet be a graph with vertices and edges. Define and . Consider a mapping by assigning different labels in to the different elements of when is even and different labels in to elements of V and repeating a label for the remaining one ...
R Ponraj, S Prabhu
doaj +1 more source
Biophysical approaches for studying viral entry
FEBS Letters, EarlyView.Viruses infect all living organisms and have been responsible for major epidemics and pandemics. Their ongoing evolutionary battle with host defenses creates a constant need for improved tools to study viral behavior. Advancing methods to probe viral attachment, fusion, and genome release deepen our understanding of how infections begin and support the
Inbar Yosibash, Raya Sorkin
wiley +1 more source
On a labeling problem in graphs
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. Chandrasekaran +2 more
openaire +1 more source
Absolutely Harmonious Labeling of Graphs [PDF]
, 2011 In this paper, we obtain necessary conditions for a graph to be absolutely harmonious and study absolutely harmonious behavior of certain classes of ...
Lourdusamy, A., Seenivasan, M.
core +1 more source