Reformulated reciprocal degree distance of transformation graph

DOI10.1016/j.endm.2016.05.022zbMath1347.05039OpenAlexW2516104291MaRDI QIDQ327657

M. Vijayaragavan, K. Pattabiraman

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.022

zbMATH Keywords

reciprocal degree distanceMycielskian graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)

Related Items (4)

Unnamed Item ⋮ Reformulated reciprocal degree distance of graph operations ⋮ Unnamed Item ⋮ Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian

Cites Work

• Unnamed Item
• Unnamed Item
• On the reciprocal degree distance of graphs
• Reciprocal degree distance of product graphs
• Calculating the edge Wiener and edge Szeged indices of graphs
• Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
• Circular chromatic numbers of Mycielski's graphs
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• Circular chromatic number for iterated Mycielski graphs
• On the reformulated reciprocal sum-degree distance of graph transformations
• On the Harary index of graph operations
• Circular chromatic number and Mycielski construction
• Sur le coloriage des graphs

This page was built for publication: Reformulated reciprocal degree distance of transformation graph