On the Randic and degree distance indices of the Mycielskian of a graph
Ali Behtoei, Mahdi Anbarloei
TL;DR
This paper investigates bounds for the Randic index and degree distance index of the Mycielskian of graphs, providing new insights into their structural properties related to graph transformations.
Contribution
It establishes sharp bounds for the Randic index and determines the degree distance index for Mycielskian graphs with diameter two.
Findings
Sharp bounds for the Randic index of Mycielskian graphs.
Exact degree distance index for Mycielskian graphs with diameter two.
Insights into the structural properties of Mycielskian graphs.
Abstract
In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph into a new graph which is called the Mycielskian of that graph. In this paper we provide some sharp bounds for the Randic index of the Mycielskian graphs. Also, we determine the degree distance index of the Mycielskian of each graph with diameter two.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graph Labeling and Dimension Problems · Finite Group Theory Research