A graph inequality on the common neighbourhood
From MaRDI portal
Publication:6330197
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 page was built for publication: A graph inequality on the common neighbourhood
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6330197)
