Open AccessNotes on maximal exceptional graphs
Author(s) -
Dragoš Cvetković
Publication year - 2004
Publication title -
publikacija elektrotehnickog fakulteta - serija matematika
Language(s) - English
Resource type - Journals
eISSN - 2406-0852
pISSN - 0353-8893
DOI - 10.2298/petf0415103c
Subject(s) - line graph , combinatorics , mathematics , pathwidth , block graph , cograph , discrete mathematics , indifference graph , 1 planar graph , graph , chordal graph
An exceptional graph is a connected graph with least eigenvalue greater than or equal to 2 which is not a generalized line graph. There are finitely many exceptional graphs. Maximal exceptional graphs have been recently identified. In this paper we discuss some details related to the construction of maximal exceptional graphs.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom