Topics
disjoint unionMilitary conflict
graphBook
In this paper we consider the disjoint union of graphs as sum graphs. We provide an upper bound on the sum number of a disjoint union of graphs and provide an application for the exclusive sum number of a graph. We conclude with some open problems
A mapping L is called a sum labeling of a graph H(V(H), E(H)) if it is an injection from V(H) to a s...
A sum divisor cordial labeling of a graph G with vertex set V (G) is a bijection f : V (G) → {1, 2, ...
In this paper we consider the two conjectures in mod sum graphs, put forward by J. Bolland, R. Laska...
A graph G is said to be a sum graph if there exist a labeling of G using positive integers such that...
AbstractA simple undirected graph H is called a sum graph if there is a labeling L of the vertices o...
All sum graphs are disconnected. In order for a connected graph to bear a sum labeling, the graph is...
AbstractA graph G=(V,E) is a sum graph if there exists a labelling of the vertices of G with distinc...
A sum labeling is a mapping ߣ from the vertices of G into the positive integers such that, for any t...
In this article the sum (or disjoint union) of graphs is formalized in the Mizar system [4], [1], ba...
A sum labeling is a mapping from the vertices of G into the positive integers such that, for any t...
AbstractLet N denote the set of all positive integers. The sum graph G+(S) of a finite subset S⊂N is...
AbstractA graph is said to be a sum graph if there exists a set S of positive integers as its node s...
AbstractLet N denote the set of positive integers. The sum graph G+(S) of a finite subset S of N is ...
AbstractWe introduced the sum graph of a set S of positive integers as the graph G+(S) having S as i...
AbstractGiven a graph G=(V,E), a labelling is a function f:V→Z+ which has different values on differ...
A mapping L is called a sum labeling of a graph H(V(H), E(H)) if it is an injection from V(H) to a s...
A sum divisor cordial labeling of a graph G with vertex set V (G) is a bijection f : V (G) → {1, 2, ...
In this paper we consider the two conjectures in mod sum graphs, put forward by J. Bolland, R. Laska...
A graph G is said to be a sum graph if there exist a labeling of G using positive integers such that...
AbstractA simple undirected graph H is called a sum graph if there is a labeling L of the vertices o...
All sum graphs are disconnected. In order for a connected graph to bear a sum labeling, the graph is...
AbstractA graph G=(V,E) is a sum graph if there exists a labelling of the vertices of G with distinc...
A sum labeling is a mapping ߣ from the vertices of G into the positive integers such that, for any t...
In this article the sum (or disjoint union) of graphs is formalized in the Mizar system [4], [1], ba...
A sum labeling is a mapping from the vertices of G into the positive integers such that, for any t...
AbstractLet N denote the set of all positive integers. The sum graph G+(S) of a finite subset S⊂N is...
AbstractA graph is said to be a sum graph if there exists a set S of positive integers as its node s...
AbstractLet N denote the set of positive integers. The sum graph G+(S) of a finite subset S of N is ...
AbstractWe introduced the sum graph of a set S of positive integers as the graph G+(S) having S as i...
AbstractGiven a graph G=(V,E), a labelling is a function f:V→Z+ which has different values on differ...
A mapping L is called a sum labeling of a graph H(V(H), E(H)) if it is an injection from V(H) to a s...
A sum divisor cordial labeling of a graph G with vertex set V (G) is a bijection f : V (G) → {1, 2, ...
In this paper we consider the two conjectures in mod sum graphs, put forward by J. Bolland, R. Laska...
Add to ORKG