| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 790 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. |
|
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Noor Alawiah, A.</creatorName> </creator> <creator> <creatorName>Nader Jafari, R.</creatorName> <affiliation>Department of Mathematics, Shahrood University of Technology, Iran</affiliation> </creator> <creator> <creatorName>Hailiza, K.</creatorName> </creator> <creator> <creatorName>Roslan, H.</creatorName> <affiliation>School of Informatics and Applied Mathematics, Universiti Malaysia Terengganu, Malaysia</affiliation> </creator> </creators> <titles> <title xml:lang='en'>Bounds for the Independence Number in k-Step Hamiltonian Graphs</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2018</publicationYear> <relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1561-4042</relatedIdentifier> <subjects> <subject>Independence number</subject> <subject>Hamiltonian graph</subject> <subject>k- Step Hamiltonian graph.</subject> <subject schemeURI='http://udcdata.info/' subjectScheme='UDC'>519.1</subject> </subjects> <dates> <date dateType='Issued'>2018-03-31</date> </dates> <resourceType resourceTypeGeneral='Text'>Journal article</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'><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></description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>
|
|
|
