E-resources
Peer reviewed
-
Li, Lei; Wang, Jianfeng; Brunetti, Maurizio
Linear algebra and its applications, 10/2024, Volume: 698Journal Article
A graph G=(VG,EG) is said to be a cograph if the path P4 does not appear among its induced subgraphs. The vicinal preorder ≺ on the vertex set VG is defined in terms of inclusions between neighborhoods. The minimum number ∇(G) of ≺-chains required to cover G is called the Dilworth number of G. In this paper it is proved that for a cograph G, the multiplicity of every Seidel eigenvalue λ≠±1 does not exceed ∇(G). This bound turns out to be tight and can be further improved for threshold graphs. Moreover, it is shown that cographs with at least two vertices have no Seidel eigenvalues in the interval (−1,1).
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.