Picture offshore wind farm

Open Access: World leading research into plasma physics...

Strathprints makes available scholarly Open Access content by researchers in the Department of Physics, including those researching plasma physics.

Plasma physics explores the '4th' state of matter known as 'plasma'. Profound new insights are being made by Strathclyde researchers in their attempts to better understand plasma, its behaviour and applications. Areas of focus include plasma wave propagation, non-linear wave interactions in the ionosphere, magnetospheric cyclotron instabilities, the parametric instabilities in plasmas, and much more.

Based on the REF 2014 GPA Scores, Times Higher Education ranked Strathclyde as number one in the UK for physics research.

Explore Open Access plasma physics research and of the Department of Physics more generally. Or explore all of Strathclyde's Open Access research...

Word-representability of line graphs

Kitaev, Sergey and Salimov, Pavel and Severs, Christopher and Ulfarsson, Henning (2011) Word-representability of line graphs. Open Journal of Discrete Mathematics, 1 (2). pp. 96-101. ISSN 2161-7643

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

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) is in E for each x not equal to y . The motivation to study representable graphs came from algebra, but this subject is interesting from graph theoretical, computer science, and combinatorics on words points of view. In this paper, we prove that for n greater than 3, the line graph of an n-wheel is non-representable. This not only provides a new construction of non-repre- sentable graphs, but also answers an open question on representability of the line graph of the 5-wheel, the minimal non-representable graph. Moreover, we show that for n greater than 4, the line graph of the complete graph is also non-representable. We then use these facts to prove that given a graph G which is not a cycle, a path or a claw graph, the graph obtained by taking the line graph of G k-times is guaranteed to be non-representable for k greater than 3.