×

Foster, Turán, and neighbors. (English) Zbl 1455.05019

Summary: In this note, we prove a graph inequality based on the sizes of the common neighborhoods. We also characterize the extremal graphs that achieve equality. The result was first discovered as a consequence of Foster’s classical theorem about electrical networks. We also present a short combinatorial proof that was inspired by a similar inequality related to the Turán’s celebrated theorem.

MSC:

05C12 Distance in graphs
05C35 Extremal problems in graph theory
05C09 Graphical indices (Wiener index, Zagreb index, Randić index, etc.)
Full Text: DOI

References:

[1] Alon, N.; Spencer, J., The Probabilistic Method (2008), New York, NY: Wiley, New York, NY · Zbl 1148.05001
[2] Bondy, J. A.; Murty, U. S. R., Graph Theory (2008), New York, NY: Springer, New York, NY · Zbl 1134.05001
[3] Caro, Y., New results on the independence number. Technical report (1979), Tel Aviv, Israel: Tel-Haviv University, Tel Aviv, Israel
[4] Foster, R. M.; Edwards, J. W.; pp, Reissner Anniversary Volume, The average impedance of an electrical network, 333-340 (1948), Contributions to Applied Mechanics. Ann Arbor: MI, Contributions to Applied Mechanics. Ann Arbor
[5] Klein, D., Resistance-distance sum rules, Croatica Chemica Acta, 73, 2, 633-649 (2002)
[6] Turán, P., On an extremal problem in graph theory, Matematikai és Fizikai Lapok, 48, 436-452 (1941) · JFM 67.0732.03
[7] Wei, V. K., A lower bound on the stability number of a simple graph. Technical report 81-11217-9 (1981), Murray Hill, NJ: Bell Laboratories, Murray Hill, NJ
[8] Zhang, J.; Yan, W., A new proof of Foster’s first theorem, Amer. Math. Monthly, 127, 1, 72-74 (2020) · Zbl 1429.05104
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.