Results 61 to 70 of about 2,535,598 (350)
Neutrosophic Divisor Cordial Labeling Graphs [PDF]
Neutrosophic Sets and SystemsIn this paper we introduced a novel concept – Neutrosophic Divisor Cordial Labeling a have proved that graphs such as wheels, helms and closed helm graph satisfy this new labeling. This paper builds upon our previous work in Neutrosophic Cordial Labeling
Tephilla Joice P, A.Rajkumar
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
The inapproximability for the (0,1)-additive number
, 2016 An {\it additive labeling} of a graph $G$ is a function $ \ell :V(G) \rightarrow\mathbb{N}$, such that for every two adjacent vertices $ v $ and $ u$ of $ G $, $ \sum_{w \sim v}\ell(w)\neq \sum_{w \sim u}\ell(w) $ ($ x \sim y $ means that $ x $ is ...
Ahadi, Arash, Dehghan, Ali
core +2 more sources
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
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.
Mendelsohn, E., Shalaby, N.
openaire +2 more sources
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. +2 more
core +1 more source
, 2015 We propose a new family of discrete energy minimization problems, which we call parsimonious labeling. Specifically, our energy functional consists of unary potentials and high-order clique potentials. While the unary potentials are arbitrary, the clique
Dokania, Puneet K., Kumar, M. Pawan
core +4 more sources
, 2020 A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints, all induced ...
Dantas, Simone +2 more
core +2 more sources
Near-optimal adjacency labeling scheme for power-law graphs [PDF]
, 2015 An adjacency labeling scheme is a method that assigns labels to the vertices of a graph such that adjacency between vertices can be inferred directly from the assigned label, without using a centralized data structure.
Petersen, Casper +3 more
core +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