Picture of athlete cycling

Open Access research with a real impact on health...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by Strathclyde researchers, including by researchers from the Physical Activity for Health Group based within the School of Psychological Sciences & Health. Research here seeks to better understand how and why physical activity improves health, gain a better understanding of the amount, intensity, and type of physical activity needed for health benefits, and evaluate the effect of interventions to promote physical activity.

Explore open research content by Physical Activity for Health...

New results on word-representable graphs

Collins, Andrew and Kitaev, Sergey and Lozin, Vadim V. (2017) New results on word-representable graphs. Discrete Applied Mathematics, 216 (Part 1). pp. 136-141. ISSN 0166-218X

[img]
Preview
PDF (Collins-Kitaev-Lozin-DAM-2014-New-results-on-word-representable-graphs)
Collins_Kitaev_Lozin_DAM_2014_New_results_on_word_representable_graphs.pdf - Accepted Author Manuscript

Download (312kB) | Preview

Abstract

A graph G=(V,E)G=(V,E) is word-representable if there exists a word ww over the alphabet VV such that letters xx and yy alternate in ww if and only if (x,y)∈E(x,y)∈E for each x≠yx≠y. The set of word-representable graphs generalizes several important and well-studied graph families, such as circle graphs, comparability graphs, 3-colorable graphs, graphs of vertex degree at most 3, etc. By answering an open question from Halldórsson et al. (2011), in the present paper we show that not all graphs of vertex degree at most 4 are word-representable. Combining this result with some previously known facts, we derive that the number of nn-vertex word-representable graphs is View the MathML source2n23+o(n2).