AbstractVizing established an upper bound on the size of a graph of given order and radius. We find a sharp upper bound on the size of a bipartite graph of given order and radius
Let k, p, q be positive integers with k < p < q+1. We prove that the maximum spectral radius of a si...
AbstractLet B, B1 and B2 be bipartite graphs, and let B→(B1,B2) signify that any red–blue edge-color...
The theory of extremal graphs without a fixed set of forbidden subgraphs is well developed. However,...
AbstractVizing established an upper bound on the size of a graph of given order and radius. We find ...
AbstractWe prove that if G is a 3-connected plane graph of order p, maximum face length l and radius...
We present upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge c...
We consider the bipartite version of the <i>degree/diameter problem</i>, namely, given natural numbe...
We show tight necessary and sufficient conditions on the sizes of small bipartite graphs whose union...
AbstractLet BCd,k be the largest possible number of vertices in a bipartite Cayley graph of degree d...
AbstractWe find the maximum number of edges for a graph of given order and value of parameter for se...
AbstractWe prove sharp bounds concerning domination number, radius, order and minimum degree of a gr...
AbstractA graph G is diameter 2-critical if its diameter is 2, and the deletion of any edge increase...
Thesis (Ph.D.)-University of KwaZulu-Natal, Westville, 2007.No abstract available
AbstractA graph G is diameter 2-critical if its diameter is two and the deletion of any edge increas...
AbstractThis paper studies the relation between the connectivity and other parameters of a bipartite...
Let k, p, q be positive integers with k < p < q+1. We prove that the maximum spectral radius of a si...
AbstractLet B, B1 and B2 be bipartite graphs, and let B→(B1,B2) signify that any red–blue edge-color...
The theory of extremal graphs without a fixed set of forbidden subgraphs is well developed. However,...
AbstractVizing established an upper bound on the size of a graph of given order and radius. We find ...
AbstractWe prove that if G is a 3-connected plane graph of order p, maximum face length l and radius...
We present upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge c...
We consider the bipartite version of the <i>degree/diameter problem</i>, namely, given natural numbe...
We show tight necessary and sufficient conditions on the sizes of small bipartite graphs whose union...
AbstractLet BCd,k be the largest possible number of vertices in a bipartite Cayley graph of degree d...
AbstractWe find the maximum number of edges for a graph of given order and value of parameter for se...
AbstractWe prove sharp bounds concerning domination number, radius, order and minimum degree of a gr...
AbstractA graph G is diameter 2-critical if its diameter is 2, and the deletion of any edge increase...
Thesis (Ph.D.)-University of KwaZulu-Natal, Westville, 2007.No abstract available
AbstractA graph G is diameter 2-critical if its diameter is two and the deletion of any edge increas...
AbstractThis paper studies the relation between the connectivity and other parameters of a bipartite...
Let k, p, q be positive integers with k < p < q+1. We prove that the maximum spectral radius of a si...
AbstractLet B, B1 and B2 be bipartite graphs, and let B→(B1,B2) signify that any red–blue edge-color...
The theory of extremal graphs without a fixed set of forbidden subgraphs is well developed. However,...
DOI
Add to ORKG