AbstractWe give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a connected graph, (ii) a connected trangle-free graph, (iii) a connected C4-free graph with n vertices and with minimum degree δ, where n tends to infinity. Some conjectures for Kr-free graphs are also stated
AbstractLet k be a positive integer and let G be a graph with |V(G)|⩾k+1. For two distinct vertices ...
AbstractLet G be any 3-connected graph containing n vertices and r the radius of G. Then the inequal...
AbstractLet n and k be positive integers satisfying k+1⩽n⩽3k − 1, and G a simple graph of order n an...
AbstractWe give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a conne...
AbstractLet f(t, D) denote the maximum possible diameter of a graph obtained from a (t+1)-edge-conne...
AbstractLet G be a bridgeless connected undirected (b.c.u.) graph. The oriented diameter of G, OD(G)...
AbstractA simple undirected connected graph with minimum degree K is said to be K-restrained. Thus t...
AbstractWe prove sharp bounds concerning domination number, radius, order and minimum degree of a gr...
AbstractThe following problem arises in the study of interconnection networks: find graphs of given ...
AbstractLet G be a connected graph of order p and S a nonempty set of vertices of G. Then the Steine...
AbstractThe note contains some conditions on a graph implying that the edge connectivity is equal to...
AbstractLet D be a strongly connected oriented graph, i.e., a digraph with no cycles of length 2, of...
AbstractThe (s,m)-radius ρs,m(G) is an important parameter associated with a message transmission ne...
AbstractIn this note, we give a short proof of the following theorem: if G is a 2-connected graph of...
AbstractIn 1986 Peyrat, Rall and Slater established a characterization of graphs G for which the dia...
AbstractLet k be a positive integer and let G be a graph with |V(G)|⩾k+1. For two distinct vertices ...
AbstractLet G be any 3-connected graph containing n vertices and r the radius of G. Then the inequal...
AbstractLet n and k be positive integers satisfying k+1⩽n⩽3k − 1, and G a simple graph of order n an...
AbstractWe give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a conne...
AbstractLet f(t, D) denote the maximum possible diameter of a graph obtained from a (t+1)-edge-conne...
AbstractLet G be a bridgeless connected undirected (b.c.u.) graph. The oriented diameter of G, OD(G)...
AbstractA simple undirected connected graph with minimum degree K is said to be K-restrained. Thus t...
AbstractWe prove sharp bounds concerning domination number, radius, order and minimum degree of a gr...
AbstractThe following problem arises in the study of interconnection networks: find graphs of given ...
AbstractLet G be a connected graph of order p and S a nonempty set of vertices of G. Then the Steine...
AbstractThe note contains some conditions on a graph implying that the edge connectivity is equal to...
AbstractLet D be a strongly connected oriented graph, i.e., a digraph with no cycles of length 2, of...
AbstractThe (s,m)-radius ρs,m(G) is an important parameter associated with a message transmission ne...
AbstractIn this note, we give a short proof of the following theorem: if G is a 2-connected graph of...
AbstractIn 1986 Peyrat, Rall and Slater established a characterization of graphs G for which the dia...
AbstractLet k be a positive integer and let G be a graph with |V(G)|⩾k+1. For two distinct vertices ...
AbstractLet G be any 3-connected graph containing n vertices and r the radius of G. Then the inequal...
AbstractLet n and k be positive integers satisfying k+1⩽n⩽3k − 1, and G a simple graph of order n an...
DOI
Add to ORKG