On the Randic and degree distance indices of the Mycielskian of a graph

2014/12/18 by Ali Behtoei, Behtoei, Ali, Mahdi Anbarloei +1
Computer Science · Mathematics · #05C07 #05C12 #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph Labeling and Dimension Problems #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.1412.5745

openalex publication_date 2014/12/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Selected properties of the Schultz molecular topological index
• Graph theory and molecular orbitals. Total φ-electron energy of alternant hydrocarbons

Related

• Randić index, diameter and the average distance
• Distance Magic Labeling of Generalised Mycielskian Graphs
• Distance Sequences to bound the Harary Index and other Wiener-type Indices of a Graph
• The Distinguishing Index of Mycielskian Graphs
• Counterexamples to conjectures on graph distance measures based on topological indexes