Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian
From MaRDI portal
Publication:2298347
DOI10.1155/2019/3764981zbMATH Open1435.05069OpenAlexW2912744867WikidataQ128497069 ScholiaQ128497069MaRDI QIDQ2298347FDOQ2298347
Authors: Feifei Zhao, Hong Bian, Haizheng Yu, Min Liu
Publication date: 20 February 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/3764981
Recommendations
- Reformulated reciprocal degree distance of transformation graph
- On the reformulated reciprocal degree distance of graphs
- Relation with reformulated reciprocal degree distance and other graph parameters
- On reformulated reciprocal product-degree distance
- Reformulated reciprocal degree distance of graph operations
Cites Work
- Circular chromatic numbers of Mycielski's graphs
- Sur le coloriage des graphs
- On the reciprocal degree distance 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
- Title not available (Why is that?)
- Reformulated reciprocal degree distance of transformation graph
- Circular chromatic number and Mycielski construction
- Reciprocal degree distance of product graphs
- Fractional chromatic numbers of cones over graphs
- Several parameters of generalized Mycielskians
- Bounds on Harary index
This page was built for publication: Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298347)