Results 351 to 360 of about 2,564,712 (373)
Some of the next articles are maybe not open access.
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 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
Graph Labeling in Competition Graph
, 2011In this paper we present an algorithm and prove the existence of graph labelings such as Z 3 - magic, E-cordial, total Ecordial, Product cordial, total product cordial, Product E-cordial, total product E-cordial labelings for the competition graph of the
E. Bala, K. Thirusangu
semanticscholar +1 more source
Graph labeling and radio channel assignment
Journal of Graph Theory, 1998The vertex-labeling of graphs with nonnegative integers provides a natural setting in which to study problems of radio channel assignment. Vertices correspond to transmitter locations and their labels to radio channels.
J. V. D. Heuvel +2 more
semanticscholar +1 more source
2012
In this talk, we will present a recent variant of the graph embedding problem on labeled graphs. Given a graph G=(V,E), a k-labeled embedding of G is a vertex labeling of G with k colors such that there exists an edge-disjoint placement of two copies of G into the complete graph $K_|V|$, preserving the labeling function.
Duchene, Eric +3 more
openaire +5 more sources
In this talk, we will present a recent variant of the graph embedding problem on labeled graphs. Given a graph G=(V,E), a k-labeled embedding of G is a vertex labeling of G with k colors such that there exists an edge-disjoint placement of two copies of G into the complete graph $K_|V|$, preserving the labeling function.
Duchene, Eric +3 more
openaire +5 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
On Partitional Labelings of Graphs
Mathematics in Computer Science, 2009The notion of partitional graphs, a subclass of sequential graphs, is introduced, and the cartesian product of a partitional graph and K2 is shown to be partitional. Every sequential graph is harmonious and felicitous. The partitional property of some bipartite graphs including the n-dimensional cube Qn is studied, and thus this paper extends what was ...
Akito Oshima, Rikio Ichishima
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.
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
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
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