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
An edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2,...,|V(...
In this note, we determine the maximum number of edges of a k-uniform hypergraph, k\u3c3, with a uni...
AbstractVizing established an upper bound on the size of a graph of given order and radius. We find ...
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 ...
In this paper we show that all cycles, wheels, trees and grids are strongly harmonic graphs. Also we...
AbstractFor integers n≥4 and ν≥n+1, let ex(ν;{C3,C4,…,Cn}) denote the maximum number of edges in a g...
106 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999.What is the maximum number of...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
AbstractIn this note, we determine the maximum number of edges of a k-uniform hypergraph, k≥3, with ...
AbstractLet f(n) be the maximum possible number of edges in a graph on n vertices in which no two cy...
We study the maximal number of edges of a graph on $p$ vertices of order dimension 4. We will show t...
An edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2,...,|V(...
In this note, we determine the maximum number of edges of a k-uniform hypergraph, k\u3c3, with a uni...
AbstractVizing established an upper bound on the size of a graph of given order and radius. We find ...
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 ...
In this paper we show that all cycles, wheels, trees and grids are strongly harmonic graphs. Also we...
AbstractFor integers n≥4 and ν≥n+1, let ex(ν;{C3,C4,…,Cn}) denote the maximum number of edges in a g...
106 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999.What is the maximum number of...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
AbstractIn this note, we determine the maximum number of edges of a k-uniform hypergraph, k≥3, with ...
AbstractLet f(n) be the maximum possible number of edges in a graph on n vertices in which no two cy...
We study the maximal number of edges of a graph on $p$ vertices of order dimension 4. We will show t...
An edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2,...,|V(...
In this note, we determine the maximum number of edges of a k-uniform hypergraph, k\u3c3, with a uni...
AbstractVizing established an upper bound on the size of a graph of given order and radius. We find ...