Changing and unchanging of the radius of a graph (Q1805308): Difference between revisions
From MaRDI portal
Removed claims |
Created claim: Wikidata QID (P12): Q127830955, #quickstatements; #temporary_batch_1722360600149 |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Robert C. Brigham / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Ferdinand Gliviak / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0024-3795(94)00153-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1973798506 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Domination alteration sets in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex domination-critical graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An extremal problem for edge domination insensitive graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3472129 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4294577 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4692391 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3983241 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4100122 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4750666 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The dissimilarity characteristic of Husimi trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4729819 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3472128 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5284032 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4024335 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Domination critical graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Domination critical graphs / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127830955 / rank | |||
Normal rank |
Latest revision as of 19:30, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Changing and unchanging of the radius of a graph |
scientific article |
Statements
Changing and unchanging of the radius of a graph (English)
0 references
12 June 1995
0 references
The authors study different classes of extremal graphs with radius \(r\) using non-standard terminologies. In the sense of the book \textit{F. Buckley} and \textit{F. Harary} [Distance in graphs (1990; Zbl 0688.05017)] the authors investigate the following classes of graphs: (a) critical by \(r\), if \(r(G - v) \neq r(G)\) for every vertex \(v\) of \(G\); (b) anticritical by \(r\), if \(r(G - v) = r(G)\) for every vertex \(v\); (c) minimal by \(r\), if \(r(G - e) > r(G)\) for every edge \(e\); (d) antiminimal by \(r\), if \(r(G - e) = r(G)\) for every edge \(e\); (e) maximal by \(r\), if \(r(G + e) < r(G)\) for every edge \(e\); (f) antimaximal by \(r\), if \(r(G + e) = r(G)\) for every edge \(e\). The study of critical, minimal, and maximal graphs by \(r\) was started earlier in 1975, and there are some serious results. Anticritical, antiminimal, and antimaximal graphs by \(r\) are new notions. The paper is useful for further studies of the radius of graphs.
0 references
distance
0 references
extremal graphs
0 references
critical
0 references
anticritical
0 references
minimal
0 references
antiminimal
0 references
maximal
0 references
antimaximal
0 references
radius of graphs
0 references