Premium
Note: The diameter of edge domination critical graphs
Author(s) -
Paris Matteo
Publication year - 1994
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230240408
Subject(s) - domination analysis , combinatorics , enhanced data rates for gsm evolution , upper and lower bounds , mathematics , graph , discrete mathematics , computer science , vertex (graph theory) , artificial intelligence , mathematical analysis
The best previous upper bound on the diameter of an edge domination critical graph with domination number γ is 3γ ‐ 5, found in a paper by Fulman. We improve the bound by one and exhibit a class of edge critical graphs with diameter [⅔γ ‐ 1]. © 1994 by John Wiley & Sons, Inc.