MERAL Myanmar Education Research and Learning Portal
-
RootNode
-
Co-operative College, Mandalay
-
Cooperative College, Phaunggyi
-
Co-operative University, Sagaing
-
Co-operative University, Thanlyin
-
Dagon University
-
Kyaukse University
-
Laquarware Technological college
-
Mandalay Technological University
-
Mandalay University of Distance Education
-
Mandalay University of Foreign Languages
-
Maubin University
-
Mawlamyine University
-
Meiktila University
-
Mohnyin University
-
Myanmar Institute of Information Technology
-
Myanmar Maritime University
-
National Management Degree College
-
Naypyitaw State Academy
-
Pathein University
-
Sagaing University
-
Sagaing University of Education
-
Taunggyi University
-
Technological University, Hmawbi
-
Technological University (Kyaukse)
-
Technological University Mandalay
-
University of Computer Studies, Mandalay
-
University of Computer Studies Maubin
-
University of Computer Studies, Meikhtila
-
University of Computer Studies Pathein
-
University of Computer Studies, Taungoo
-
University of Computer Studies, Yangon
-
University of Dental Medicine Mandalay
-
University of Dental Medicine, Yangon
-
University of Information Technology
-
University of Mandalay
-
University of Medicine 1
-
University of Medicine 2
-
University of Medicine Mandalay
-
University of Myitkyina
-
University of Public Health, Yangon
-
University of Veterinary Science
-
University of Yangon
-
West Yangon University
-
Yadanabon University
-
Yangon Technological University
-
Yangon University of Distance Education
-
Yangon University of Economics
-
Yangon University of Education
-
Yangon University of Foreign Languages
-
Yezin Agricultural University
-
New Index
-
Item
{"_buckets": {"deposit": "dfb9969f-0684-47c4-ae0a-f049916ae873"}, "_deposit": {"id": "870", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "870"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/870", "sets": ["user-um"]}, "communities": ["um"], "control_number": "870", "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Characterization of Bipartite Graphs With given Hamiltonicity", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "In this paper, we first give a characterization of the bipartite graphs G satisfying Moreover, we compare the value of 2-domination number and independence number in trees and give bounds on these two parameters in terms of the order and the number of pendant vertices of the tree. More precisely we show that for a nontrivial tree T, (n(T) + +2)/3 (n(T) + )/2 and (n(T) + – 1)/2. Finally, we characterize the trees achieving equality in each bound."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Bipartite"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-05-05"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Characterization of Bipartite Graphs With given Hamiltonicity pdf.pdf", "filesize": [{"value": "743 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 743000.0, "url": {"url": "https://meral.edu.mm/record/870/files/Characterization of Bipartite Graphs With given Hamiltonicity pdf.pdf"}, "version_id": "12cb914c-5bf5-4cab-a500-790fb7842ddb"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "1", "subitem_journal_title": "Myingyan degree college Research Journal", "subitem_volume": "3"}]}, "item_1583103147082": {"attribute_name": "Conference papaers", "attribute_value_mlt": [{}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_supervisor(s)": []}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Zaw Myint"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Journal article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2012"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "https://umoar.mu.edu.mm/handle/123456789/238"}, "item_title": "Characterization of Bipartite Graphs With given Hamiltonicity", "item_type_id": "21", "owner": "1", "path": ["1582967046255"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000000870", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-03-05"}, "publish_date": "2020-03-05", "publish_status": "0", "recid": "870", "relation": {}, "relation_version_is_last": true, "title": ["Characterization of Bipartite Graphs With given Hamiltonicity"], "weko_shared_id": -1}
Characterization of Bipartite Graphs With given Hamiltonicity
http://hdl.handle.net/20.500.12678/0000000870
http://hdl.handle.net/20.500.12678/0000000870a4adbdc0-fc30-4023-9e03-20e7b93d0d61
dfb9969f-0684-47c4-ae0a-f049916ae873
Name / File | License | Actions |
---|---|---|
![]() |
|
Publication type | ||||||
---|---|---|---|---|---|---|
Journal article | ||||||
Upload type | ||||||
Publication | ||||||
Title | ||||||
Title | Characterization of Bipartite Graphs With given Hamiltonicity | |||||
Language | en | |||||
Publication date | 2012 | |||||
Authors | ||||||
Zaw Myint | ||||||
Description | ||||||
In this paper, we first give a characterization of the bipartite graphs G satisfying Moreover, we compare the value of 2-domination number and independence number in trees and give bounds on these two parameters in terms of the order and the number of pendant vertices of the tree. More precisely we show that for a nontrivial tree T, (n(T) + +2)/3 (n(T) + )/2 and (n(T) + – 1)/2. Finally, we characterize the trees achieving equality in each bound. | ||||||
Keywords | ||||||
Bipartite | ||||||
Identifier | https://umoar.mu.edu.mm/handle/123456789/238 | |||||
Journal articles | ||||||
1 | ||||||
Myingyan degree college Research Journal | ||||||
3 | ||||||
Conference papaers | ||||||
Books/reports/chapters | ||||||
Thesis/dissertations |