Relationships between distance domination parameters.
2-3 graphs which have Vizing's adjacency property.
On the graphs with maximum distance or -diameter
Minimal claw-free graphs
A graph is a minimal claw-free graph (m.c.f. graph) if it contains no (claw) as an induced subgraph and if, for each edge of , contains an induced claw. We investigate properties of m.c.f. graphs, establish sharp bounds on their orders and the degrees of their vertices, and characterize graphs which have m.c.f. line graphs.
Page 1