|
GraphTheory[IsIntegerGraph]
|
|
Calling Sequence
|
|
IsIntegerGraph(G)
|
|
|
Description
|
|
|
•
|
IsIntegerGraph returns true if its argument G is an integer graph, namely if the spectrum of G consists of only integer numbers, and false otherwise.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
| (3) |
|
>
|
|
|
| (4) |
|
>
|
|
|
| (5) |
|
>
|
|
|
| (6) |
|
>
|
|
|
| (7) |
|
>
|
|
|
| (8) |
|
>
|
|
|
| (9) |
|
|
Download Help Document
Was this information helpful?
