Hajos stable graphs
รหัสดีโอไอ
Creator 1. Manimuthu Yamuna
2. Kumarasamy Karthika
Title Hajos stable graphs
Publisher Research and Development Office, Prince of Songkla University
Publication Year 2561
Journal Title Songklanakarin Journal of Science and Technology
Journal Vol. 40
Journal No. 2
Page no. 333
Keyword domination number, Hajos construction, Hajos graph, stable graph
URL Website http://rdo.psu.ac.th/sjstweb/index.php
ISSN 0125-3395
Abstract Let G1 and G2 be two undirected graphs, (v w) be an edge of G1, and (x y) be an edge of G2. Hajos construction formsa new graph H, that combines the two graphs by identifying vertices v and x into a single vertex, removing the two edges (v w)and (x y), and adding a new edge (w y). In this paper we introduce a new kind of graph called the Hajos stable graph, where thestable property is defined using the domination number of graphs G1 and G2. We have obtained a necessary and sufficientcondition for graphs G1 and G2 to be Hajos stable.
Songklanakarin Journal of Science and Technology (SJST)

บรรณานุกรม

EndNote

APA

Chicago

MLA

DOI Smart-Search
สวัสดีค่ะ ยินดีให้บริการสอบถาม และสืบค้นข้อมูลตัวระบุวัตถุดิจิทัล (ดีโอไอ) สำนักการวิจัยแห่งชาติ (วช.) ค่ะ