Jul 2, 2002 · A graph is said to be exceptional if it is connected, has least eigenvalue greater than or equal to 2; and is not a generalized line graph.
In this paper we discuss some details related to the construction of maximal exceptional graphs. An exceptional graph is a connected graph with least eigenvalue ...
A graph is said to be exceptional if it is connected, has least eigenvalue greater than or equal to −2, and is not a generalized line graph.
It is convenient to partition the maximal exceptional graphs into three types: (a) those which are cones of order 29, (b) those with maximal degree 28 and more ...
Abstract. A graph is said to be exceptional if it is connected, has least eigenvalue greater than or equal to -2, and is not a generalized line graph.
The maximal exceptional graphs are determined by a computer search using the star complement technique, and it is shown how they can be found by theoretical ...
In this paper we discuss some details related to the construction of maximal exceptional graphs. An exceptional graph is a connected graph with least eigenvalue ...
People also ask
What is the maximal graph?
What is the difference between maximum and maximal graph?
What is a maximal subgraph in graph theory?
A b s t r a c t . A graph is said to be exceptional if it is connected , has least eigenvalue greater than or equal to −2, and is not a generalized line.
A graph is said to be exceptional if it is connected, has least eigenvalue greater than or equal to −2, and is not a generalized line graph. Generalized line ...
A graph is said to be exceptional if it is connected, has least eigenvalue greater than or equal to and is not a generalized line graph.