Szeged index of bipartite unicyclic graphs
عنوان مقاله: Szeged index of bipartite unicyclic graphs
شناسه ملی مقاله: JR_JDMA-1-1_002
منتشر شده در در سال 1390
شناسه ملی مقاله: JR_JDMA-1-1_002
منتشر شده در در سال 1390
مشخصات نویسندگان مقاله:
Hui Dong - Department of Mathematics, South China Normal University Guangzhou ۵۱۰۶۳۱, P.R. China
Bo Zhou - Department of Mathematics, South China Normal University Guangzhou ۵۱۰۶۳۱, P.R. China
خلاصه مقاله:
Hui Dong - Department of Mathematics, South China Normal University Guangzhou ۵۱۰۶۳۱, P.R. China
Bo Zhou - Department of Mathematics, South China Normal University Guangzhou ۵۱۰۶۳۱, P.R. China
The Szeged index of a connected graph G is defined as the sum of products n۱(e|G)n۲(e|G) over all edges e = uv of G where n۱(e|G) and n۲(e|G) are respectively the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer to vertex v than to vertex u In this paper, we determine the n-vertex bipartite unicyclic graphs with the first, the second, the third and the fourth smallest Szeged indices.
کلمات کلیدی: Szeged index, unicyclic graphs, bipartite graphs, distance
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1784485/