Word-representable graph: Difference between revisions

Revision as of 23:29, 22 April 2020

Revision as of 23:58, 22 April 2020

Line 4:

*[[Word-representable graphs]]

-->

In the mathematical field of [[graph theory]], a [[graph ''G''&nbsp;=&nbsp;(discrete mathematics)|graph]] is ''V'word-representable',''E'' if it can be characterised by a word (or sequence) whose entries alternate in a prescribed way. In particular, if the vertex set of the graph is '''word-representable'V'', one should be iffable thereto existschoose a word ''w'' over the alphabet ''V'' such that letters ''a'' and ''b'' alternate in ''w'' if and only if the edgepair ''ab'' is an edge in ''E''the graph. (Letters ''a'' and ''b'' '''alternate''' in ''w'' if, after removing from ''w'' all letters but the copies of ''a'' and ''b'', we eitherone obtainobtains a word ''abab''... or a word ''baba''.... In this context, we say that [[W|''w'']] is ''G''<nowiki/>'s '''word-representant''', or that ''w'' '''represents''' ''G''.) For example, the [[cycle graph]] labeled by ''xa'', ''yb'', ''zc'' and ''sd'' in clock-wise direction is word-representable because it can be represented by ''szxsyxzyabdacdbc''. The smallest (by: the numberpairs of&nbsp;''ab'', vertices)''bc'', non-word-representable''cd'' graph is the [[wheel graph]]and ''Wad''₅ alternate, which isbut the onlypairs non-word-representable''ac'' graphand on''bd'' 6do verticesnot.

The word ''w'' is ''G''<nowiki/>'s ''word-representant'', and on says that that ''w'' ''represents'' ''G''. The smallest (by the number of&nbsp; vertices) non-word-representable graph is the [[wheel graph]] ''W''₅, which is the only non-word-representable graph on 6 vertices.

The definition of a word-representable graph works both in labelled and unlabelled cases since any labelling of a graph is equivalent to any other labelling. Also, the class of word-representable graphs is [[Hereditary property|hereditary]]. Word-representable graphs generalise several important classes of graphs such as [[Circle graph|circle graphs]], [[Graph coloring|3-colorable graphs]] and [[Comparability graph|comparability graphs]]. Various generalisations of the theory of word-representable graphs accommodate representation of ''any'' graph.