Results 201 to 210 of about 140,706 (235)
Some of the next articles are maybe not open access.
Alpha Labeling of Cyclic Graphs
International Journal of Applied and Computational Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kumar, Ajay +3 more
openaire +1 more source
2018 IEEE 34th International Conference on Data Engineering (ICDE), 2018
Nowadays, a graph serves as a fundamental data structure for many applications. As graph edges stream in, users are often only interested in the recent data. In data exploration, how to store and process such massive amounts of graph stream data becomes a significant problem.
Chunyao Song, Tingjian Ge
openaire +1 more source
Nowadays, a graph serves as a fundamental data structure for many applications. As graph edges stream in, users are often only interested in the recent data. In data exploration, how to store and process such massive amounts of graph stream data becomes a significant problem.
Chunyao Song, Tingjian Ge
openaire +1 more source
Antimagic Labelings of Join Graphs
Mathematics in Computer Science, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bača, Martin +3 more
openaire +1 more source
Ars combinatoria, 1999
The authors investigate such integer labelings \(w\) (called ``magic'') of edges of a graph \(G\), in which \(\sum_{v\in e}w(e)\) is a constant \(s\) independent of the vertex \(v\). They introduce basis graphs of type I and II. For the type I a unique, up to a constant factor, labeling exists with \(s>0\) and no \(0\) label.
Gobel, F., Hoede, C.
openaire +2 more sources
The authors investigate such integer labelings \(w\) (called ``magic'') of edges of a graph \(G\), in which \(\sum_{v\in e}w(e)\) is a constant \(s\) independent of the vertex \(v\). They introduce basis graphs of type I and II. For the type I a unique, up to a constant factor, labeling exists with \(s>0\) and no \(0\) label.
Gobel, F., Hoede, C.
openaire +2 more sources
On Partitional Labelings of Graphs
Mathematics in Computer Science, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ichishima, Rikio, Oshima, Akito
openaire +2 more sources
Graph antimagic labeling: A survey
Discrete Mathematics, Algorithms and Applications, 2023An antimagic labeling of a simple graph [Formula: see text] is a bijection [Formula: see text] such that [Formula: see text] for any two vertices [Formula: see text] in [Formula: see text]. We survey the results about antimagic labelings and other labelings motivated by antimagic labelings of graphs, and present some conjectures and open questions.
Jin, Jingxiang, Tu, Zhuojie
openaire +2 more sources
Cybernetics and Systems Analysis, 2020
The authors present some results on group distance magic and antimagic graph labelings. In particular, they present some results about group distance magic regular graphs, as well as of the powers of \(C_4\) and other cycles \(C_{2^k}\) (considered as the Cartesian product of several factors). The results are very specific, but could be interesting for
Semeniuta, M. F., Donets, G. A.
openaire +2 more sources
The authors present some results on group distance magic and antimagic graph labelings. In particular, they present some results about group distance magic regular graphs, as well as of the powers of \(C_4\) and other cycles \(C_{2^k}\) (considered as the Cartesian product of several factors). The results are very specific, but could be interesting for
Semeniuta, M. F., Donets, G. A.
openaire +2 more sources
ODD GRACEFUL LABELINGS OF GRAPHS
Discrete Mathematics, Algorithms and Applications, 2009A graph G = (V(G), E(G)) with q edges is said to be odd graceful if there exists an injection f from V(G) to {0, 1, 2, …, 2q - 1} such that the edge labeling set is {1, 3, 5, …, 2q - 1} with each edge xy assigned the label |f(x) - f(y)|. In this paper, we prove that Pn × Pm (m = 2, 3, 4), generalized crown graphs Cn ⊙ K1,t and gear graphs are odd ...
Gao, Zhen-Bin +2 more
openaire +1 more source
International Journal of Mathematics Trends and Technology, 2021
Kavitha S, Stella Arputha Mary V L
openaire +1 more source
Kavitha S, Stella Arputha Mary V L
openaire +1 more source
Graph Transformer for Label Placement
IEEE Transactions on Visualization and Computer GraphicsPlacing text labels is a common way to explain key elements in a given scene. Given a graphic input and original label information, how to place labels to meet both geometric and aesthetic requirements is an open challenging problem. Geometry-wise, traditional rule-driven solutions struggle to capture the complex interactions between labels, let alone ...
Jingwei Qu +4 more
openaire +2 more sources