Results 261 to 270 of about 919,081 (302)
Some of the next articles are maybe not open access.
On Partitional Labelings of Graphs
Mathematics in Computer Science, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rikio Ichishima, Akito Oshima
openaire +4 more sources
Graphs and Combinatorics, 1997
A mapping \(f: E\to\{0,1\}^m\) of a graph \(G=(V,E)\) is called a mod 2 coding of \(G\), if the induced mapping \(g:V\to \{0,1\}^m\), defined by \(g(v)= \sum_{u\in V,\{u,v\}\in E}f(\{u,v\})\) assigns a different number to each vertex, where summations are taken modulo 2.
Louis Caccetta, Rui-Zhong Jia
openaire +2 more sources
A mapping \(f: E\to\{0,1\}^m\) of a graph \(G=(V,E)\) is called a mod 2 coding of \(G\), if the induced mapping \(g:V\to \{0,1\}^m\), defined by \(g(v)= \sum_{u\in V,\{u,v\}\in E}f(\{u,v\})\) assigns a different number to each vertex, where summations are taken modulo 2.
Louis Caccetta, Rui-Zhong Jia
openaire +2 more sources
SIAM Journal on Discrete Mathematics, 1992
Summary: Given a graph \(G\) and positive integer \(d\), the pair-labeling number \(r^*(G,d)\) is the minimum \(n\) such that each vertex in \(G\) can be assigned a pair of numbers from \(\{0,1,\dots,n-1\}\) so that any two numbers used at adjacent vertices differ by at least \(d\) modulo \(n\).
David R. Guichard, John W. Krussel
openaire +2 more sources
Summary: Given a graph \(G\) and positive integer \(d\), the pair-labeling number \(r^*(G,d)\) is the minimum \(n\) such that each vertex in \(G\) can be assigned a pair of numbers from \(\{0,1,\dots,n-1\}\) so that any two numbers used at adjacent vertices differ by at least \(d\) modulo \(n\).
David R. Guichard, John W. Krussel
openaire +2 more sources
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 +2 more sources
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 +2 more sources
Journal of Graph Theory, 1979
AbstractGiven a graph Γ an abelian group G, and a labeling of the vertices of Γ with elements of G, necessary and sufficient conditions are stated for the existence of a labeling of the edges in which the label of each vertex equals the product of the labels of its incident edges. Such an edge labeling is called compatible.
Paul H. Edelman, Michael E. Saks
openaire +1 more source
AbstractGiven a graph Γ an abelian group G, and a labeling of the vertices of Γ with elements of G, necessary and sufficient conditions are stated for the existence of a labeling of the edges in which the label of each vertex equals the product of the labels of its incident edges. Such an edge labeling is called compatible.
Paul H. Edelman, Michael E. Saks
openaire +1 more source