St Andrews Research Repository

St Andrews University Home
View Item 
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.

Solving computational problems in the theory of word-representable graphs

Thumbnail
View/Open
Akgun_2019_Solving_computational_JIS_19.2.5.pdf (441.6Kb)
Date
24/02/2019
Author
Akgün, Özgür
Gent, Ian P.
Kitaev, Sergey
Zantema, Hans
Keywords
Word-representable graph
Representation number
Enumeration
Semi-transitive orientation
k-semi-transitive orientation
QA75 Electronic computers. Computer science
DAS
Metadata
Show full item record
Altmetrics Handle Statistics
Abstract
A simple graph G = (V, E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w iff xy ∈ E. Word-representable graphs generalize several important classes of graphs. A graph is word-representable if it admits a semi-transitive orientation. We use semi-transitive orientations to enumerate connected non-word-representable graphs up to the size of 11 vertices, which led to a correction of a published result. Obtaining the enumeration results took 3 CPU years of computation. Also, a graph is word-representable if it is k-representable for some k, that is, if it can be represented using k copies of each letter. The minimum such k for a given graph is called graph's representation number. Our computational results in this paper not only include distribution of k-representable graphs on at most 9 vertices, but also have relevance to a known conjecture on these graphs. In particular, we find a new graph on 9 vertices with high representation number. Also, we prove that a certain graph has highest representation number among all comparability graphs on odd number of vertices. Finally, we introduce the notion of a k-semi-transitive orientation refining the notion of a semi-transitive orientation, and show computationally that the refinement is not equivalent to the original definition, unlike the equivalence of k-representability and word-representability.
Citation
Akgün , Ö , Gent , I P , Kitaev , S & Zantema , H 2019 , ' Solving computational problems in the theory of word-representable graphs ' , Journal of Integer Sequences , vol. 22 , no. 2 , 19.2.5 . < https://cs.uwaterloo.ca/journals/JIS/VOL22/Kitaev/kitaev11.html >
Publication
Journal of Integer Sequences
Status
Peer reviewed
ISSN
1530-7638
Type
Journal article
Rights
© 2019, the Author(s). This work has been made available online in accordance with the publisher's policies. This is the final published version of the work, which was originally published at https://cs.uwaterloo.ca/journals/JIS/VOL22/Kitaev/kitaev11.html
Collections
  • University of St Andrews Research
URL
https://cs.uwaterloo.ca/journals/JIS/VOL22/Kitaev/kitaev11.html
URI
http://hdl.handle.net/10023/17701

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

Advanced Search

Browse

All of RepositoryCommunities & CollectionsBy Issue DateNamesTitlesSubjectsClassificationTypeFunderThis CollectionBy Issue DateNamesTitlesSubjectsClassificationTypeFunder

My Account

Login

Open Access

To find out how you can benefit from open access to research, see our library web pages and Open Access blog. For open access help contact: openaccess@st-andrews.ac.uk.

Accessibility

Read our Accessibility statement.

How to submit research papers

The full text of research papers can be submitted to the repository via Pure, the University's research information system. For help see our guide: How to deposit in Pure.

Electronic thesis deposit

Help with deposit.

Repository help

For repository help contact: Digital-Repository@st-andrews.ac.uk.

Give Feedback

Cookie policy

This site may use cookies. Please see Terms and Conditions.

Usage statistics

COUNTER-compliant statistics on downloads from the repository are available from the IRUS-UK Service. Contact us for information.

© University of St Andrews Library

University of St Andrews is a charity registered in Scotland, No SC013532.

  • Facebook
  • Twitter