Recognizing and generating unswitchable graphs

Discrete Mathematics Algorithms and Applications 2026 Open access

Read full text
Authors: Asish Kumar Mukhopadhyay, Daniel John, Srivatsan Vasudevan
DOI: 10.1142/s1793830926500758
Cited by: 0

Abstract

In this paper, we show that unswitchable graphs are a proper subclass of solid graphs, and exploit this fact to propose efficient algorithms for their recognition and generation.

Fields of Study & Subjects

Advanced Graph Theory Research Graph Labeling and Dimension Problems

Publication details

Journal / source
Discrete Mathematics Algorithms and Applications
Publisher
World Scientific Pub Co Pte Ltd
Publication date
31 July 2026
Language
EN