| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 791 3 |
| Ultima descărcare din IBN: 2020-07-22 11:36 |
| Căutarea după subiecte similare conform CZU |
| 519.1 (117) |
| Analiză combinatorică. Teoria grafurilor (115) |
 SM ISO690:2012NOOR A’LAWIAH, Abd Aziz, NADER JAFARI, Rad, HAILIZA, Kamarulhaili, ROSLAN, Hasni. Bounds for the Independence Number in k-Step Hamiltonian Graphs. In: Computer Science Journal of Moldova, 2018, nr. 1(76), pp. 15-28. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
|
| Numărul 1(76) / 2018 / ISSN 1561-4042 /ISSNe 2587-4330 | |
|
|
| CZU: 519.1 | |
| MSC 2010: 05C69, 05C78. | |
| Pag. 15-28 | |
 Descarcă PDF |
|
| Rezumat | |
For a given integer k, a graph G of order n is called k-step Hamiltonian if there is a labeling v1, v2, ..., vn of vertices of G such that d(v1, vn) = d(vi, vi+1) = k for i = 1, 2, ..., n − 1. The independence number of a graph is the maximum cardinality of a subset of pair-wise non-adjacent vertices. In this paper we study the independence number in k-step Hamiltonian graphs. We present sharp upper bounds as well as sharp lower bounds, and then present a construction that produces infinite families of k-step Hamiltonian graphs with arbitrarily large independence number. |
|
| Cuvinte-cheie Independence number, Hamiltonian graph, k- Step Hamiltonian graph. |
|
|
Cerif XML Export
<?xml version='1.0' encoding='utf-8'?> <CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'> <cfResPubl> <cfResPublId>ibn-ResPubl-61946</cfResPublId> <cfResPublDate>2018-03-31</cfResPublDate> <cfVol>76</cfVol> <cfIssue>1</cfIssue> <cfStartPage>15</cfStartPage> <cfISSN>1561-4042</cfISSN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/61946</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>Bounds for the Independence Number in k-Step Hamiltonian Graphs</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>Independence number; Hamiltonian graph; k- Step Hamiltonian graph.</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'><p>For a given integer k, a graph G of order n is called k-step Hamiltonian if there is a labeling v1, v2, ..., vn of vertices of G such that d(v1, vn) = d(vi, vi+1) = k for i = 1, 2, ..., n − 1. The independence number of a graph is the maximum cardinality of a subset of pair-wise non-adjacent vertices. In this paper we study the independence number in k-step Hamiltonian graphs. We present sharp upper bounds as well as sharp lower bounds, and then present a construction that produces infinite families of k-step Hamiltonian graphs with arbitrarily large independence number.</p></cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2018-03-31T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2018-03-31T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-56969</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2018-03-31T24:00:00</cfStartDate> </cfPers_ResPubl> <cfPers_ResPubl> <cfPersId>ibn-person-56970</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2018-03-31T24:00:00</cfStartDate> </cfPers_ResPubl> <cfPers_ResPubl> <cfPersId>ibn-person-56971</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2018-03-31T24:00:00</cfStartDate> </cfPers_ResPubl> <cfPers_ResPubl> <cfPersId>ibn-person-56972</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2018-03-31T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-56969</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-56969-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2018-03-31T24:00:00</cfStartDate> <cfFamilyNames>Noor A’lawiah</cfFamilyNames> <cfFirstNames>Abd Aziz</cfFirstNames> </cfPersName_Pers> </cfPers> <cfPers> <cfPersId>ibn-Pers-56970</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-56970-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2018-03-31T24:00:00</cfStartDate> <cfFamilyNames>Nader Jafari</cfFamilyNames> <cfFirstNames>Rad</cfFirstNames> </cfPersName_Pers> </cfPers> <cfPers> <cfPersId>ibn-Pers-56971</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-56971-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2018-03-31T24:00:00</cfStartDate> <cfFamilyNames>Hailiza</cfFamilyNames> <cfFirstNames>Kamarulhaili</cfFirstNames> </cfPersName_Pers> </cfPers> <cfPers> <cfPersId>ibn-Pers-56972</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-56972-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2018-03-31T24:00:00</cfStartDate> <cfFamilyNames>Roslan</cfFamilyNames> <cfFirstNames>Hasni</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>
|
|
|
