CHARACTERIZATION OF α-EXCELLENT 2-TREES

Magda Dettlaff, Michael A. Henning, Jerzy Topp

Research output: Contribution to journalArticlepeer-review

Abstract

A graph is α-excellent if every vertex of the graph is contained in some maximum independent set of the graph. In this paper, we present two characterizations of the α-excellent 2-trees.

Original languageEnglish
Pages (from-to)67-80
Number of pages14
JournalDiscussiones Mathematicae - Graph Theory
Volume45
Issue number1
DOIs
Publication statusPublished - 2025

Keywords

  • excellent graph
  • independence number
  • k-tree

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'CHARACTERIZATION OF α-EXCELLENT 2-TREES'. Together they form a unique fingerprint.

Cite this