In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bounds given by Beineke and Hegde [3] and Adiga, Ramaswamy and Somashekara [2], for n ≥ 28
AbstractLet f(n) be the maximum possible number of edges in a graph on n vertices in which no two cy...
AbstractAn edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2...
Let H be a graph. If G is an n-vertex simple graph that does not contain H as a minor, what is the m...
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicati...
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicati...
A graph with p vertices is said to be strongly multiplicative if its vertices can be labelled 1,2,.....
AbstractLet f(n) (f2(n)) be the maximum possible number of edges in a graph (2-connected simple grap...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
106 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999.What is the maximum number of...
In this paper we show that all cycles, wheels, trees and grids are strongly harmonic graphs. Also we...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
AbstractVizing established an upper bound on the size of a graph of given order and radius. We find ...
An edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2,...,|V(...
AbstractIn 1985, Erdős and Neśetril conjectured that the strong edge-coloring number of a graph is b...
We study the maximal number of edges of a graph on $p$ vertices of order dimension 4. We will show t...
AbstractLet f(n) be the maximum possible number of edges in a graph on n vertices in which no two cy...
AbstractAn edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2...
Let H be a graph. If G is an n-vertex simple graph that does not contain H as a minor, what is the m...
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicati...
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicati...
A graph with p vertices is said to be strongly multiplicative if its vertices can be labelled 1,2,.....
AbstractLet f(n) (f2(n)) be the maximum possible number of edges in a graph (2-connected simple grap...
Several upper bounds are given for the maximum number of edges e possible in a graph depending upon ...
106 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999.What is the maximum number of...
In this paper we show that all cycles, wheels, trees and grids are strongly harmonic graphs. Also we...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
AbstractVizing established an upper bound on the size of a graph of given order and radius. We find ...
An edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2,...,|V(...
AbstractIn 1985, Erdős and Neśetril conjectured that the strong edge-coloring number of a graph is b...
We study the maximal number of edges of a graph on $p$ vertices of order dimension 4. We will show t...
AbstractLet f(n) be the maximum possible number of edges in a graph on n vertices in which no two cy...
AbstractAn edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2...
Let H be a graph. If G is an n-vertex simple graph that does not contain H as a minor, what is the m...
DOI
Add to ORKG