1 research outputs found
On the -good-neighbor connectivity of graphs
Connectivity and diagnosability are two important parameters for the fault
tolerant of an interconnection network . In 1996, F\`{a}brega and Fiol
proposed the -good-neighbor connectivity of . In this paper, we show that
for , and graphs with and
trees with for are
characterized, respectively. In the end, we get the three extremal results for
the -good-neighbor connectivity.Comment: 14 pages, 2 figures. arXiv admin note: substantial text overlap with
arXiv:1904.06527; text overlap with arXiv:1609.08885, arXiv:1612.05381 by
other author