Add to ORKGLet G be a finite connected graph. We give an asymptotically tight upper bound on the size of G in terms of order, radius and minimum degree. Our result is a strengthening of an old classical theorem of Vizing (1967) if minimum degree is prescribed
The average size of connected vertex subsets of a connected graph generalises a much-studied paramet...
We present upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge c...
This thesis details the results of an investigation of bounds on four distances measures, namely, r...
Graph TheoryLet G be a finite connected graph. We give an asymptotically tight upper bound on the si...
AbstractThe degree set of a finite simple graph G is the set of distinct degrees of vertices of G. A...
AbstractWe give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a conne...
AbstractLet G be a graph with order n and minimum degree δ(≥2). Erdős et al. found an upper bound of...
AbstractLet G be a simple graph of order n without isolated vertices. If the integer h satisfies h ⩾...
AbstractIn this note, we use a technique introduced by Dankelmann and Entringer [P. Dankelmann, R.C....
AbstractWe prove sharp bounds concerning domination number, radius, order and minimum degree of a gr...
AbstractIn this note, we study the degree distance of a graph which is a degree analogue of the Wien...
AbstractThe inverse degree r(G) of a finite graph G=(V,E) is defined as r(G)=∑v∈V1degv. We prove tha...
In this thesis, we deal with bounds on distance measures, namely, degree distance, radius, diameter...
The average size of connected vertex subsets of a connected graph generalises a much-studied paramet...
AbstractVizing established an upper bound on the size of a graph of given order and radius. We find ...
The average size of connected vertex subsets of a connected graph generalises a much-studied paramet...
We present upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge c...
This thesis details the results of an investigation of bounds on four distances measures, namely, r...
Graph TheoryLet G be a finite connected graph. We give an asymptotically tight upper bound on the si...
AbstractThe degree set of a finite simple graph G is the set of distinct degrees of vertices of G. A...
AbstractWe give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a conne...
AbstractLet G be a graph with order n and minimum degree δ(≥2). Erdős et al. found an upper bound of...
AbstractLet G be a simple graph of order n without isolated vertices. If the integer h satisfies h ⩾...
AbstractIn this note, we use a technique introduced by Dankelmann and Entringer [P. Dankelmann, R.C....
AbstractWe prove sharp bounds concerning domination number, radius, order and minimum degree of a gr...
AbstractIn this note, we study the degree distance of a graph which is a degree analogue of the Wien...
AbstractThe inverse degree r(G) of a finite graph G=(V,E) is defined as r(G)=∑v∈V1degv. We prove tha...
In this thesis, we deal with bounds on distance measures, namely, degree distance, radius, diameter...
The average size of connected vertex subsets of a connected graph generalises a much-studied paramet...
AbstractVizing established an upper bound on the size of a graph of given order and radius. We find ...
The average size of connected vertex subsets of a connected graph generalises a much-studied paramet...
We present upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge c...
This thesis details the results of an investigation of bounds on four distances measures, namely, r...