

























In this paper, we define the Mycielskian of a signed graph and discuss the properties of balance and switching in the Mycielskian of a given signed graph. We provide a condition for ensuring the Mycielskian of a balanced signed graph remains balanced, leading to the construction of a balanced Mycielskian. We establish a relation between the chromatic numbers of a signed graph and its Mycielskian. We also study the structure of different matrices related to the Mycielskian of a signed graph.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。