Results 71 to 80 of about 2,393,702 (209)
Radio Labeling for Strong Product K3 ⊠ Pn
IEEE Access, 2020 Many variations of graph labeling has been defined in the literature. e.g., graceful, harmonious and radio labeling etc. In information technology and in data sciences, we need secrecy of data, different channel assignment and accuracy of transmission of
Hengxiao Qi +4 more
doaj +1 more source
Label-Guided Graph Exploration with Adjustable Ratio of Labels [PDF]
arXiv, 2012 The graph exploration problem is to visit all the nodes of a connected graph by a mobile entity, e.g., a robot. The robot has no a priori knowledge of the topology of the graph or of its size. Cohen et al. \cite{Ilcinkas08} introduced label guided graph exploration which allows the system designer to add short labels to the graph nodes in a ...
arxiv
AKCE International Journal of Graphs and Combinatorics, 2020 A -labeling of a graph is a labeling of vertices of the graph by -tuples of non-negative integers in such a way that two vertices of are adjacent if and only if their label -tuples differ in each coordinate.
L. Yahyaei, S.A. Katre
doaj +1 more source
Neighborhood-Prime Labelings of Trees and Other Classes of Graphs [PDF]
arXiv, 2018 A neighborhood-prime labeling of a graph is a variation of a prime labeling in which the vertices are assigned labels from $1$ to $|V(G)|$ such that the $\gcd$ of the labels in the neighborhood of each non-degree $1$ vertex is equal to $1$. In this paper, we examine neighborhood-prime labelings of several classes of graphs such as polygonal snakes and ...
arxiv
Edge even graceful labeling of some graphs
Journal of the Egyptian Mathematical Society, 2019 Edge even graceful labeling is a new type of labeling since it was introduced in 2017 by Elsonbaty and Daoud (Ars Combinatoria 130:79–96, 2017). In this paper, we obtained an edge even graceful labeling for some path-related graphs like Y- tree, the ...
Mohamed R. Zeen El Deen
doaj +1 more source
--supermagic labeling of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A simple graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . The graph is said to be -magic if there exists a total labeling such that for every subgraph of isomorphic to , is constant. Additionally, the labeling is called
C. Chithra, G. Marimuthu, G. Kumar
doaj +1 more source
Primitive Ideals of Labelled Graph $C^*$-algebras [PDF]
arXiv, 2019 Given a directed graph $E$ and a labeling $\mathcal{L}$, one forms the labelled graph $C^*$-algebra by taking a weakly left--resolving labelled space $(E, \mathcal{L}, \mathcal{B})$ and considering a universal generating family of partial isometries and projections.
arxiv
Totally Antimagic Total labeling of Ladders, Prisms and Generalised Pertersen graphs [PDF]
arXiv, 2016 Given a graph $G$, a total labeling on $G$ is called edge-antimagic total (respectively, vertex-antimagic total) if all edge-weights (respectively, vertex-weights) are pairwise distinct. If a labeling on $G$ is simultaneously edge-antimagic total and vertex-antimagic total, it is called a totally antimagic total labeling.
arxiv
Collaborative Graph Walk for Semi-supervised Multi-Label Node Classification [PDF]
arXiv, 2019 In this work, we study semi-supervised multi-label node classification problem in attributed graphs. Classic solutions to multi-label node classification follow two steps, first learn node embedding and then build a node classifier on the learned embedding.
arxiv
Shorter Labeling Schemes for Planar Graphs [PDF]
arXiv, 2019 An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every graph $G$ from the class, assigns bit strings (labels) to vertices of $G$ so that for any two vertices $u,v$, whether $u$ and $v$ are adjacent can be determined by a fixed procedure that examines only their labels.
arxiv