JOURNAL ARTICLE

Equitable critical graphs.

  • Published In: Discrete Mathematics, Algorithms & Applications, 2023, v. 15, n. 8. P. 1 1 of 3

  • Database: Academic Search Ultimate 2 of 3

  • Authored By: Jency, Loura; Raj, Benedict Michael 3 of 3

Abstract

A proper vertex coloring of a graph G is equitable if the sizes of any two color classes differ by at most one. The equitable chromatic number of a graph G , denoted by χ = (G) , is the minimum k such that G is equitably k -colorable. In this paper, we discuss some basic properties of equitable critical graphs as well as equitable k -critical graphs. A graph G is called equitable critical if χ = (H) ≠ χ = (G) for every proper subgraph H of G. G is called equitable k -critical if it is equitable k -chromatic and equitable critical. Furthermore, we discuss that equitable vertex (edge) critical, equitable critical vertex (edge) graphs. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:Discrete Mathematics, Algorithms & Applications. 2023/11, Vol. 15, Issue 8, p1
  • Document Type:Article
  • Subject Area:Science
  • Publication Date:2023
  • ISSN:1793-8309
  • DOI:10.1142/S1793830922501683
  • Accession Number:169947321
  • Copyright Statement:Copyright of Discrete Mathematics, Algorithms & Applications is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.