Results 51 to 60 of about 746 (100)

Mean Cordial Labeling For Three Star Graph

Journal of Physics: Conference Series, 2019
If ...
V. S. Shainy, L. Vinothkumar, V. Balaji
semanticscholar   +1 more source

Cyclic Cordial Labeling for the Lemniscate Graphs and Their Second Powers

Journal of Mathematics, Volume 2025, Issue 1, 2025.
A lemniscate graph, usually denoted by Ln,m, is defined as a union of two cycles Cn and Cm that share a common vertex. A simple graph is called cyclic group cordial if we can provide a three elements’ cyclic group labeling satisfying certain conditions.
M. A. AbdAllah, S. I. Nada, M. M. A. Al-Shamiri, M. A. Afify, Ma Xuanlong   +4 more
wiley   +1 more source

New Mean Graphs [PDF]

, 2011
A graph that admits a Smarandachely super mean m-labeling is called a Smarandachely super m-mean graph, particularly, a mean graph if m = 2. In this paper, some new families of mean graphs are investigated.
Vaidya, S.K.
core   +1 more source

On the Number of α-Labeled Graphs

Discussiones Mathematicae Graph Theory, 2018
When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of the graph, it becomes an α-labeling. This is the most restrictive type of difference-vertex labeling and it is located at the very core of this research ...
Barrientos Christian, Minion Sarah
doaj   +1 more source

The Distance Magic Index of a Graph

Discussiones Mathematicae Graph Theory, 2018
Let G be a graph of order n and let S be a set of positive integers with |S| = n. Then G is said to be S-magic if there exists a bijection ϕ : V (G) → S satisfying ∑x∈N(u)ϕ(x) = k (a constant) for every u ∈ V (G). Let α(S) = max{s : s ∈ S}.
Godinho Aloysius, Singh Tarkeshwar, Arumugam S.   +2 more
doaj   +1 more source

Weak Set-Labeling Number of Certain IASL-Graphs

, 2015
Let $\mathbb{N}_0$ be the set of all non-negative integers, let $X\subset \mathbb{N}_0$ and $\mathcal{P}(X)$ be the the power set of $X$. An integer additive set-labeling (IASL) of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$
Chithra, K. P., Germina, K. A., Sudev, N. K.   +2 more
core   +1 more source

A Study on Integer Additive Set-Valuations of Signed Graphs [PDF]

, 2015
Let $\N$ denote the set of all non-negative integers and $\cP(\N)$ be its power set. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $f:V(G)\to \cP(\N)-\{\emptyset\}$ such that the induced function $f^+:E(G) \to
Germina, K. A., Sudev, N. K.
core   +4 more sources

On k-prime graphs

Open Mathematics
In the context of a simple undirected graph GG, a kk-prime labeling refers to assigning distinct integers from the set {k,k+1,…,∣V(G)∣+k−1}\left\{k,k+1,\ldots ,| V\left(G)| +k-1\right\} to its vertices, such that adjacent vertices in GG are labeled with ...
Abughneim Omar A., Abughazaleh Baha’
doaj   +1 more source

Decomposition of Certain Complete Bipartite Graphs into Prisms

Discussiones Mathematicae Graph Theory, 2017
Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj   +1 more source

Topological Integer Additive Set-Sequential Graphs

, 2015
Let $\mathbb{N}_0$ denote the set of all non-negative integers and $X$ be any non-empty subset of $\mathbb{N}_0$. Denote the power set of $X$ by $\mathcal{P}(X)$. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $
Augustine, Germina, Sudev, Chithra, Sudev, Naduvath   +2 more
core   +2 more sources