J4 ›› 2010, Vol. 45 ›› Issue (10): 40-44.

• Articles • Previous Articles     Next Articles

Independent domination bicritical graphs

XU Lan1,2, XU Ying 1, ZHANG Li 3   

  1. 1. College of Mathematics and System Science, Xinjiang University, Urumqi 830046, Xinjiang, China;
    2. Department of Mathematics, Changji University, Changji 831100, Xinjiang, China;
    3. Department of Applied Mathematics, Shanghai Finance University, Shanghai 201209, China
  • Received:2009-08-02 Online:2010-10-16 Published:2010-10-19
  • About author:XU Lan(1964-), female, associate professor, master, her research mainly focuses on graph theory and application. Email: xulan6400@sina.cn

PDF (PC)

964

Abstract:

A graph G is independent domination bicritical if the removal of any pair of vertices decreases the independent domination number. Some particular classes of graphs which are independent domination bicritical are discussed and some properties of independent domination bicritical graphs are studied. Finally, ways of constructing an independent domination bicritical graph from smaller independent domination bicritical graphs are presented.

Key words: independent domination number; independent domination bicritical graph; vertex-i-critical

No related articles found!
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd