Domination number of cubic graphs with large girth
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10125712" target="_blank" >RIV/00216208:11320/12:10125712 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1002/jgt.20568" target="_blank" >http://dx.doi.org/10.1002/jgt.20568</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.20568" target="_blank" >10.1002/jgt.20568</a>
Alternative languages
Result language
angličtina
Original language name
Domination number of cubic graphs with large girth
Original language description
We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n+ O(n/g)<3n/10 + O(n/g).
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Graph Theory
ISSN
0364-9024
e-ISSN
—
Volume of the periodical
69
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
12
Pages from-to
131-142
UT code for WoS article
000298092300003
EID of the result in the Scopus database
—