Connectivity of the Mycielskian of a digraph |
| |
Authors: | Litao Guo Xiaofeng Guo |
| |
Institution: | aSchool of Mathematical Sciences, Xiamen University, Xiamen Fujian 361005, China |
| |
Abstract: | In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph G into a new graph μ(G), which is called the Mycielskian of G. This work investigates the vertex connectivity and arc connectivity of the Mycielskian of a digraph D. This generalizes the recent results due to Balakrishnan and Raj R. Balakrishnan, S.F. Raj, Connectivity of the Mycielskian of a graph, Discrete Math, 308 (2008), 2607–2610]. |
| |
Keywords: | Mycielskian Vertex connectivity Arc connectivity |
本文献已被 ScienceDirect 等数据库收录! |
|