Graphs Related to Diameter and Centerf

Abstract

A graph is said to be an L-graph if all its paths of diametral length contain a central vertex of G. Using an earlier result we show that any graph can be embedded to an L-graph of radius a and diameter b, where a b 2a. We show that the known bounds of the number of edges and the maximum degree of the graphs of diameter d 2 are sharp for L-graphs, too. Then… (More)

Topics

  • Presentations referencing similar topics