RECIPROCAL DEGREE DISTANCE OF SOME GRAPH OPERATIONS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

PATTABIRAMAN K.; VIJAYARAGAVAN M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: TRANSACTIONS ON COMBINATORICS Year:2013 | Volume:2 | Issue:4 Page(s): 13-24

Download Full-Text

View:

285

Download:

159

Cites:

Information Journal Paper

Title

RECIPROCAL DEGREE DISTANCE OF SOME GRAPH OPERATIONS

Author(s)

PATTABIRAMAN K. | VIJAYARAGAVAN M. | Issue Writer Certificate

Keywords

RECIPROCAL DEGREE DISTANCE

HARARY INDEX

GRAPH OPERATIONS

Abstract

The RECIPROCAL DEGREE DISTANCE (RDD), defined for a connected graph G as vertex-degree- weighted sum of the reciprocal distances, that is, RDD (G) = S u, vÎV (G) dG (u)+dG (v)/dG (u, v). The RECIPROCAL DEGREE DISTANCE is a weight version of the HARARY INDEX, just as the degree distance is a weight version of the Wiener index. In this paper, we present exact formulae for the RECIPROCAL DEGREE DISTANCE of join, tensor product, strong product and wreath product of graphs in terms of other graph invariants including the degree distance, HARARY INDEX, the first Zagreb index and first Zagreb coindex. Finally, we apply some of our results to compute the RECIPROCAL DEGREE DISTANCE of fan graph, wheel graph, open fence and closed fence graphs.

Cites

GENERALIZED DEGREE DISTANCE OF STRONG PRODUCT OF GRAPHS

References

No record.

Cite

APA: Copy

PATTABIRAMAN, K., & VIJAYARAGAVAN, M.. (2013). RECIPROCAL DEGREE DISTANCE OF SOME GRAPH OPERATIONS. TRANSACTIONS ON COMBINATORICS, 2(4), 13-24. SID. https://sid.ir/paper/669243/en

Vancouver: Copy

PATTABIRAMAN K., VIJAYARAGAVAN M.. RECIPROCAL DEGREE DISTANCE OF SOME GRAPH OPERATIONS. TRANSACTIONS ON COMBINATORICS[Internet]. 2013;2(4):13-24. Available from: https://sid.ir/paper/669243/en

IEEE: Copy

K. PATTABIRAMAN, and M. VIJAYARAGAVAN, “RECIPROCAL DEGREE DISTANCE OF SOME GRAPH OPERATIONS,” TRANSACTIONS ON COMBINATORICS, vol. 2, no. 4, pp. 13–24, 2013, [Online]. Available: https://sid.ir/paper/669243/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops