A graph inequality on the common neighbourhood
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:S77WHKPZrecord.jsonopen to challenge →
classification
math.CO
keywords
inequalitycommongraphtheoremachievecelebratedcharacterizeclassical
read the original abstract
In this note we prove a graph inequality based on the sizes of the common neighbourhoods. We also characterize the extremal graphs that achieve the equality. The result was first discovered as a consequence of the classical Forster's theorem in electric networks. We also present a short combinatorial proof that was inspired by a similar inequality related to the celebrated Tur\'an's theorem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.