Results 51 to 60 of about 882,414 (306)
Super Mean Labeling of Some Classes of Graphs [PDF]
, 2012 Approaching topics as Smarandachely super m-mean labeling, Smarandachely super m-mean graph, super mean labeling, super mean ...
P.Jeyanthi +3 more
core +1 more source
PMC-LABELING OF SOME CLASSES OF GRAPHS CONTAINING CYCLES
BarekengLet be a graph with p vertices and q edges. We have introduced a new graph labeling method using integers and cordial-related works and investigated some graphs for this labeling technique.
R Ponraj, S Prabhu, M Sivakumar
doaj +1 more source
Information Processing Letters, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sebastian Czerwinski +2 more
openaire +3 more sources
Note on edge irregular reflexive labelings of graphs
AKCE International Journal of Graphs and Combinatorics, 2019 For a graph , an edge labeling and a vertex labeling are called total -labeling, where . The total -labeling is called an edge irregular reflexive -labeling of the graph , if for every two different edges and of , one has The minimum for which the graph ...
Martin Bača +4 more
doaj +1 more source
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
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
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 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
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