Results 51 to 60 of about 140,706 (235)
Succinct Representation of Labeled Graphs [PDF]
Algorithmica, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barbay, Jérémy +3 more
openaire +4 more sources
List (d,1)-total labelling of graphs embedded in surfaces [PDF]
, 2011 The (d,1)-total labelling of graphs was introduced by Havet and Yu. In this paper, we consider the list version of (d,1)-total labelling of graphs. Let G be a graph embedded in a surface with Euler characteristic $\epsilon$ whose maximum degree $\Delta(G)
Liu, Guizhen, Yu, Yong, Zhang, Xin
core
Radio Graceful Labelling of Graphs
Theory and Applications of Graphs, 2020 Summary: Radio labelling problem of graphs have their roots in communication problem known as Channel Assignment Problem. For a simple connected graph \(G=(V(G),E(G))\), a radio labeling is a mapping \(f:V(G)\to \{0,1,2,\dots\}\) such that \(|f(u)-f(v)|\ge\text{diam}(G)+1-d(u,v)\) for each pair of distinct vertices \(u,v\in V(G)\), where \(\text{diam ...
Saha, Laxman, Basunia, Alamgir Rahaman
openaire +5 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 +3 more sources
Edge even graceful labelling of new families of graphs
Journal of Taibah University for Science, 2019 Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling. A graph G is called edge even graceful if there is a bijection $f: E(G) \rightarrow \{2, 4,\ldots , 2q\} $ such that ...
S. N. Daoud, Ahmed N. Elsawy
doaj +1 more source
The Distance Irregular Reflexive k-Labeling of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 A total k-labeling is a function fe from the edge set to the set {1, 2, . . . , ke} and a function fv from the vertex set to the set {0, 2, 4, . . . , 2kv}, where k = max{ke, 2kv}.
Ika Hesti Agustin +4 more
doaj +1 more source
Neutrosophic Sets and Systems, 2019 In this paper, some new connectivity concepts in neutrosophic labeling graphs are portrayed. Definition of neutrosophic strong arc, neutrosophic partial cut node, Neutrosophic Bridge and block are introduced with examples. Also, neutrosophic labeling tree and partial intuitionistic fuzzy labeling tree is explored with interesting properties.
M. Gomathi, V. Keerthika
openaire +2 more sources
Graph Theory Towards Module-K Odd-Elegant Labelling Of Graphical Passwords
MATEC Web of Conferences, 2017 Graph labellings have been applied in many areas of science and engineering, such as in the development of redundant arrays of independent disks which incorporate redundancy utilizing erasure codes, algorithms, design of highly accurate optical gauging ...
Zhang Xiaohui, Sun Hui, Yao Bing
doaj +1 more source
The reflexive edge strength on some almost regular graphs
Heliyon, 2021 A function f with domain and range are respectively the edge set of graph G and natural number up to ke, and a function f with domain and range are respectively the vertex set of graph G and the even natural number up to 2kv are called a total k-labeling
Ika Hesti Agustin +4 more
doaj +1 more source
Variable neighbourhood search for the minimum labelling Steiner tree problem [PDF]
, 2007 We present a study on heuristic solution approaches to the minimum labelling Steiner tree problem, an NP-hard graph problem related to the minimum labelling spanning tree problem.
José Andrés +4 more
core +1 more source