On the edge-Szeged index of unicyclic graphs with perfect matchings
Discret. Appl. Math., pp. 207-223, 2020.
Abstract The edge-Szeged index of a graph G is defined as S z e ( G ) = ∑ u v ∈ E ( G ) m u ( u v | G ) m v ( u v | G ) , where m u ( u v | G ) (resp., m v ( u v | G ) ) is the number of edges whose distance to vertex ...More
Full Text (Upload PDF)
PPT (Upload PPT)