Degree resistance distance of unicyclic graphs
Let G be a connected graph with vertex set V(G). The degree resistance distance of G is defined as the sum over all pairs of vertices of the terms [d(u)+d(v)] R(u,v), where d(u) is the degree of vertex u, and R(u,v) denotes the resistance distance between u and v. In this paper, we characterize n-ve...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2012-06-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=1080&_ob=cb45bc3cac05fe499d71eb2ac6e5ec20&fileName=full_text.pdf |
| _version_ | 1828726919338655744 |
|---|---|
| author | Ivan Gutman Linhua Feng Guihai Yu |
| author_facet | Ivan Gutman Linhua Feng Guihai Yu |
| author_sort | Ivan Gutman |
| collection | DOAJ |
| description | Let G be a connected graph with vertex set V(G). The degree resistance distance of G is defined as the sum over all pairs of vertices of the terms [d(u)+d(v)] R(u,v), where d(u) is the degree of vertex u, and R(u,v) denotes the resistance distance between u and v. In this paper, we characterize n-vertex unicyclic graphs having minimum and second minimum degree resistance distance. |
| first_indexed | 2024-04-12T13:50:24Z |
| format | Article |
| id | doaj.art-76f3273f503f4614a7e8b34313de8384 |
| institution | Directory Open Access Journal |
| issn | 2251-8657 2251-8665 |
| language | English |
| last_indexed | 2024-04-12T13:50:24Z |
| publishDate | 2012-06-01 |
| publisher | University of Isfahan |
| record_format | Article |
| series | Transactions on Combinatorics |
| spelling | doaj.art-76f3273f503f4614a7e8b34313de83842022-12-22T03:30:33ZengUniversity of IsfahanTransactions on Combinatorics2251-86572251-86652012-06-01122740Degree resistance distance of unicyclic graphsIvan GutmanLinhua FengGuihai YuLet G be a connected graph with vertex set V(G). The degree resistance distance of G is defined as the sum over all pairs of vertices of the terms [d(u)+d(v)] R(u,v), where d(u) is the degree of vertex u, and R(u,v) denotes the resistance distance between u and v. In this paper, we characterize n-vertex unicyclic graphs having minimum and second minimum degree resistance distance.http://www.combinatorics.ir/?_action=showPDF&article=1080&_ob=cb45bc3cac05fe499d71eb2ac6e5ec20&fileName=full_text.pdfResistance distance (in graph)degree distancedegree resistance distance |
| spellingShingle | Ivan Gutman Linhua Feng Guihai Yu Degree resistance distance of unicyclic graphs Transactions on Combinatorics Resistance distance (in graph) degree distance degree resistance distance |
| title | Degree resistance distance of unicyclic graphs |
| title_full | Degree resistance distance of unicyclic graphs |
| title_fullStr | Degree resistance distance of unicyclic graphs |
| title_full_unstemmed | Degree resistance distance of unicyclic graphs |
| title_short | Degree resistance distance of unicyclic graphs |
| title_sort | degree resistance distance of unicyclic graphs |
| topic | Resistance distance (in graph) degree distance degree resistance distance |
| url | http://www.combinatorics.ir/?_action=showPDF&article=1080&_ob=cb45bc3cac05fe499d71eb2ac6e5ec20&fileName=full_text.pdf |
| work_keys_str_mv | AT ivangutman degreeresistancedistanceofunicyclicgraphs AT linhuafeng degreeresistancedistanceofunicyclicgraphs AT guihaiyu degreeresistancedistanceofunicyclicgraphs |