Reformulated reciprocal degree distance of transformation graph

DOI10.1016/J.ENDM.2016.05.022zbMATH Open1347.05039OpenAlexW2516104291MaRDI QIDQ327657FDOQ327657

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

Mycielskian graphreciprocal degree distance

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Circular chromatic numbers of Mycielski's graphs
• Sur le coloriage des graphs
• On the reciprocal degree distance of graphs
• Calculating the edge Wiener and edge Szeged indices of graphs
• Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
• 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
• Reciprocal degree distance of product graphs

Cited In (4)

• Reformulated reciprocal degree distance of graph operations
• Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian
• Title not available (Why is that?)
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327657)