Semi Square Stable Graphs

Mohammad Abudayah and Omar Alomari
Additional contact information
Mohammad Abudayah: Department of Mathematics, German Jordanian University, Amman 11180, Jordan
Omar Alomari: Department of Mathematics, German Jordanian University, Amman 11180, Jordan

Mathematics, 2019, vol. 7, issue 7, 1-9

Abstract: The independent number of a graph G is the cardinality of the maximum independent set of G , denoted by α ( G ) . The independent dominating number is the cardinality of the smallest independent set that dominates all vertices of G . In this paper, we introduce a new class of graphs called semi-square stable for which α ( G 2 ) = i ( G ) . We give a necessary and sufficient condition for a graph to be semi-square stable, and we study when interval graphs are semi-square stable.

Keywords: independent set; independent dominating set; efficient dominating set; semi-square stable graph; interval graphs; corona product (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/7/7/597/pdf (application/pdf)
https://www.mdpi.com/2227-7390/7/7/597/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:7:y:2019:i:7:p:597-:d:245250

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().