Title

Changing And Unchanging Of The Radius Of A Graph

Abstract

Harary introduced the concept of changing and unchanging of a graphical invariant i, asking for characterizations of graphs G = (V, E) for which i(G - v), i(G - e) or i(G + e) either differ from i(G) or are equal to i(G) for all v ∈ V, e ∈ E, or e ∈ E, respectively, where E ̄ is the set of edges in the complement of G. This paper examines changing and unchanging properties of the radius of a graph, an important parameter in network design. © 1995.

Publication Date

3-1-1995

Publication Title

Linear Algebra and Its Applications

Volume

217

Issue

C

Number of Pages

67-82

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/0024-3795(94)00153-5

Socpus ID

21844504981 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/21844504981

This document is currently not available here.

Share

COinS