Results 331 to 340 of about 2,422,838 (348)
Some of the next articles are maybe not open access.
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.
Michael Saks, Paul H. Edelman
openaire +2 more sources
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.
Michael Saks, Paul H. Edelman
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.
Tingjian Ge, Chunyao Song
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.
Tingjian Ge, Chunyao Song
openaire +2 more sources
International Journal of Mathematics Trends and Technology, 2021
S. Kavitha, L StellaArputhaMaryV
semanticscholar +1 more source
S. Kavitha, L StellaArputhaMaryV
semanticscholar +1 more source
Journal of Discrete Mathematical Sciences and Cryptography, 2008
Abstract The index of cordiality of a simple graph G is the min{|e f’ (0)−e f’ (1)|} where the minimum is taken over all the binary labelings of G with |v f (0)−v f (1)|≤1 and f’ (uv)=|f (u)−f (v)|. We obtain upper bounds of this parameter for the union and corona of two graphs with known cordiality indices and also the product of a graph with P 2. The
R. Ponraj, M. Sundaram, S. Somasundaram
openaire +2 more sources
Abstract The index of cordiality of a simple graph G is the min{|e f’ (0)−e f’ (1)|} where the minimum is taken over all the binary labelings of G with |v f (0)−v f (1)|≤1 and f’ (uv)=|f (u)−f (v)|. We obtain upper bounds of this parameter for the union and corona of two graphs with known cordiality indices and also the product of a graph with P 2. The
R. Ponraj, M. Sundaram, S. Somasundaram
openaire +2 more sources
Linear and Multilinear Algebra, 1995
In this note we first study the structure of the incidence matrix of the complete graph on ν points and then we present a linear algebraic approach to labelling of finite simple graphs.
Rouzbeh Torabi +1 more
openaire +2 more sources
In this note we first study the structure of the incidence matrix of the complete graph on ν points and then we present a linear algebraic approach to labelling of finite simple graphs.
Rouzbeh Torabi +1 more
openaire +2 more sources
Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83, 1983
We announce an algebraic approach to the problem of assigning canonical forms to graphs. We compute canonical forms and the associated canonical labelings (or renumberings) in polynomial time for graphs of bounded valence, in moderately exponential, exp(n½ + o(1)),time for general graphs, in subexponential, nlog n, time for tournaments and for 2-(n,k,l)
Eugene M. Luks, László Babai
openaire +2 more sources
We announce an algebraic approach to the problem of assigning canonical forms to graphs. We compute canonical forms and the associated canonical labelings (or renumberings) in polynomial time for graphs of bounded valence, in moderately exponential, exp(n½ + o(1)),time for general graphs, in subexponential, nlog n, time for tournaments and for 2-(n,k,l)
Eugene M. Luks, László Babai
openaire +2 more sources
Computing, 1978
According to the classification of labelled graph grammars by Nagl [4], it can be shown that the class of context-sensitive graph languages is equivalent to the class of context-free graph languages and the context-free graph languages properly include the regular graph languages.
Kang Yueh, S. Levy
openaire +2 more sources
According to the classification of labelled graph grammars by Nagl [4], it can be shown that the class of context-sensitive graph languages is equivalent to the class of context-free graph languages and the context-free graph languages properly include the regular graph languages.
Kang Yueh, S. Levy
openaire +2 more sources
MGTag: a Multi-Dimensional Graph Labeling Scheme for Fast Reachability Queries
IEEE International Conference on Data Engineering, 2018Shuang Zhou +3 more
semanticscholar +1 more source
Satellite image time series classification and analysis using an adapted graph labeling
International Workshop on the Analysis of Multitemporal Remote Sensing Images, 2015S. Réjichi, F. Chaabane
semanticscholar +1 more source