| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 357 6 |
| Ultima descărcare din IBN: 2022-02-03 12:39 |
| Căutarea după subiecte similare conform CZU |
| 519.17 (68) |
| Analiză combinatorică. Teoria grafurilor (115) |
 SM ISO690:2012BERCOV, Vladimir. Connected Domination Number and a New Invariant in Graphs with Independence Number Three. In: Computer Science Journal of Moldova, 2021, nr. 1(85), pp. 96-104. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
  Computer Science Journal of Moldova |
||||||
| Numărul 1(85) / 2021 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 519.17 | ||||||
| Pag. 96-104 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
Adding a connected dominating set of vertices to a graph G increases its number of Hadwiger h(G). Based on this obvious property in [2] we introduced a new invariant (G) for which (G) ≤ h(G). We continue to study its property. For a graph G with independence number three without induced chordless cycles C7 and with n(G) vertices, (G) ≥ n(G)/4. |
||||||
| Cuvinte-cheie dominating set, number of Hadwiger, clique number, Independence number |
||||||
|
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>Bercov, V.</creatorName> <affiliation>Department of Mathematics BMCC CUNY, Statele Unite ale Americii</affiliation> </creator> </creators> <titles> <title xml:lang='en'>Connected Domination Number and a New Invariant in Graphs with Independence Number Three</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2021</publicationYear> <relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1561-4042</relatedIdentifier> <subjects> <subject>dominating set</subject> <subject>number of Hadwiger</subject> <subject>clique number</subject> <subject>Independence number</subject> <subject schemeURI='http://udcdata.info/' subjectScheme='UDC'>519.17</subject> </subjects> <dates> <date dateType='Issued'>2021-03-01</date> </dates> <resourceType resourceTypeGeneral='Text'>Journal article</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'><p>Adding a connected dominating set of vertices to a graph G increases its number of Hadwiger h(G). Based on this obvious property in [2] we introduced a new invariant (G) for which (G) ≤ h(G). We continue to study its property. For a graph G with independence number three without induced chordless cycles C7 and with n(G) vertices, (G) ≥ n(G)/4.</p></description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>
|
|
|
