On the representability of line graphs

Kitaev, Sergey and Salimov, Pavel and Severs, Christopher and Ulfarsson, Henning; Mauri, Giancarlo and Leporati, Alberto, eds. (2011) On the representability of line graphs. In: Developments in Language Theory. Lecture Notes in Computer Science . Springer-Verlag Berlin, GBR, pp. 478-479. ISBN 978-3-642-22320-4

Full text not available in this repository.Request a copy from the Strathclyde author

Official URL: https://doi.org/10.1007/978-3-642-22321-1_46

Abstract

A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x,y) ∈ E for each x ≠ y. Such a W is called a word-representant of G. Note that in this paper we use the term graph to mean a finite, simple graph, even though the definition of representable is applicable to more general graphs.

ORCID iDs

Kitaev, Sergey

, Salimov, Pavel, Severs, Christopher and Ulfarsson, Henning; Mauri, Giancarlo and Leporati, Alberto

Citations and altmetrics

Item metadata

Item type:	Book Section
ID code:	49964
Dates:	Date Event 2011 Published
Keywords:	logics, line graphs, meanings of programs, Electronic computers. Computer science, Computer Science(all)
Subjects:	Science > Mathematics > Electronic computers. Computer science
Department:	Faculty of Science > Computer and Information Sciences
Depositing user:	Pure Administrator
Date deposited:	21 Oct 2014 13:56
Last modified:	20 Jan 2021 15:38
URI:	https://strathprints.strath.ac.uk/id/eprint/49964

Export

CORE (COnnecting REpositories)