Results 311 to 320 of about 2,304,207 (332)
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
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 +3 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 +3 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
On the properties of anti fuzzy graph magic labeling
THE 2ND INTERNATIONAL CONFERENCE ON SCIENCE, MATHEMATICS, ENVIRONMENT, AND EDUCATION, 2019Graph labeling is one of the famous topics in the study of fuzzy graph. This article was considering to anti fuzzy graph magic labeling. As a new concept in anti fuzzy graph, we adapted from the previous study of fuzzy graph about the related concept ...
Adika Setia Brata +4 more
semanticscholar +1 more source
On the properties of bipolar anti fuzzy graph magic labeling
THE 2ND INTERNATIONAL CONFERENCE ON SCIENCE, MATHEMATICS, ENVIRONMENT, AND EDUCATION, 2019This article was considering to bipolar anti fuzzy graph magic labeling. Bipolar anti fuzzy graph be seen as new concept, therefore to find the properties, we adapted from the previous study of bipolar fuzzy graph.
Ilman Firmansa +5 more
semanticscholar +1 more source
Joint Graph Decomposition & Node Labeling: Problem, Algorithms, Applications
Computer Vision and Pattern Recognition, 2016We state a combinatorial optimization problem whose feasible solutions define both a decomposition and a node labeling of a given graph. This problem offers a common mathematical abstraction of seemingly unrelated computer vision tasks, including ...
Evgeny Levinkov +9 more
semanticscholar +1 more source
On sequential labelings of graphs
Journal of Graph Theory, 1983AbstractA valuation on a simple graph G is an assignment of labels to the vertices of G which induces an assignment of labels to the edges of G. β‐valuations, also called graceful labelings, and α‐valuations, a subclass of graceful labelings, have an extensive literature; harmonious labelings have been introduced recently by Graham and Sloane.
openaire +3 more sources
Graphs and Combinatorics, 1998
Let \(G=(V,E)\) be a graph which is not a tree. For an injective function \(g:V\to\{0,\dots,| E| -1\}\) define \(g^*:E\to{\mathbb{N}}\) such that \(g^*(uv)=g(u)+g(v)\) for all edges \(uv\in E\). The graph \(G\) is called sequential if \(g^*(E)\) is a sequence of distinct consecutive integers. Furthermore, for graphs \(G\) and \(H\) denote by \(G\odot H\
openaire +2 more sources
Let \(G=(V,E)\) be a graph which is not a tree. For an injective function \(g:V\to\{0,\dots,| E| -1\}\) define \(g^*:E\to{\mathbb{N}}\) such that \(g^*(uv)=g(u)+g(v)\) for all edges \(uv\in E\). The graph \(G\) is called sequential if \(g^*(E)\) is a sequence of distinct consecutive integers. Furthermore, for graphs \(G\) and \(H\) denote by \(G\odot H\
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
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