Results 81 to 90 of about 2,393,702 (209)
The Enumeration of Point Labelled Chromatic Graphs and Trees [PDF]
, 1960 T. L. Austin
openalex +1 more source
The Number of k-Coloured Graphs on Labelled Nodes [PDF]
, 1960 Ronald C. Read
openalex +1 more source
Minimum Coprime Labelings for Operations on Graphs [PDF]
arXiv, 2017 A prime labeling of a graph of order $n$ is a labeling of the vertices with the integers $1$ to~$n$ in which adjacent vertices have relatively prime labels. A coprime labeling maintains the same criterion on adjacent vertices using any set of distinct positive integers.
arxiv
-labeling numbers of square of paths
AKCE International Journal of Graphs and Combinatorics, 2017 For , the -labeling arose from code assignment problem. That is, let , and be positive numbers, an --labeling of a graph is a mapping such that if , and if . The span of is the difference between the maximum and the minimum numbers assigned by .
Qiong Wu, Wai Chee Shiu
doaj +1 more source
An application on edge irregular reflexive labeling for $ m^t $-graph of cycle graph
AIMS MathematicsGraph labeling is an increasingly popular problem in graph theory. A mapping converts a collection of graph components into a set of integers known as labels.
Muhammad Amir Asif +5 more
doaj +1 more source
A Complexity Theory for Labeling Schemes [PDF]
arXiv, 2018 In a labeling scheme the vertices of a given graph from a particular class are assigned short labels such that adjacency can be algorithmically determined from these labels. A representation of a graph from that class is given by the set of its vertex labels.
arxiv
Some Results on Divisior Cordial Graphs
Journal of New Theory, 2020 In this paper, we introduce some results on divisor cordial graphs where we find some upper bound for the labeling of any simple graph and r-regular graph and describe the divisor cordial labeling for some families of graphs such the jellyfish graph ...
Shakir Salman, Mohammed Seoud
doaj
Multi-Label Graph Convolutional Network Representation Learning [PDF]
arXiv, 2019 Knowledge representation of graph-based systems is fundamental across many disciplines. To date, most existing methods for representation learning primarily focus on networks with simplex labels, yet real-world objects (nodes) are inherently complex in nature and often contain rich semantics or labels, e.g., a user may belong to diverse interest groups
arxiv
Antimagic labelings of regular bipartite graphs: An application of the Marriage Theorem [PDF]
Journal of Graph Theory. Vol. 60, March 2009, pp. 173-182, 2007 A labeling of a graph is a bijection from $E(G)$ to the set $\{1, 2,..., |E(G)|\}$. A labeling is \textit{antimagic} if for any distinct vertices $u$ and $v$, the sum of the labels on edges incident to $u$ is different from the sum of the labels on edges incident to $v$. We say a graph is antimagic if it has an antimagic labeling.
arxiv