Abstract
The transmission of a vertex in a connected graph is the sum of all distances from that vertex to the others. It is said to be normalized if divided by n - 1, where n denotes the order of the graph. The proximity of a graph is the minimum normalized transmission, while the remoteness is the maximum normalized transmission. In this paper, we give Nordhaus-Gaddum-type inequalities for proximity and remoteness in graphs. The extremal graphs are also characterized for each case.
| Original language | English |
|---|---|
| Pages (from-to) | 2827-2835 |
| Number of pages | 9 |
| Journal | Computers and Mathematics with Applications |
| Volume | 59 |
| Issue number | 8 |
| DOIs | |
| Publication status | Published - Apr 2010 |
| Externally published | Yes |
Keywords
- Extremal graph
- Nordhaus-Gaddum
- Proximity
- Remoteness
ASJC Scopus subject areas
- Modelling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics
Fingerprint
Dive into the research topics of 'Nordhaus-Gaddum relations for proximity and remoteness in graphs'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS