A necessary and sufficient eigenvector condition for a connected graph to be bipartite (Q3075146): Difference between revisions
From MaRDI portal
Created a new Item |
Import IPFS CIDs |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2118772790 / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreihnwr6pquxcq4ncovtvqyl4ldufmmydg4lnewx6obgxmc2r6bcezu / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:18, 22 February 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A necessary and sufficient eigenvector condition for a connected graph to be bipartite |
scientific article |
Statements
A necessary and sufficient eigenvector condition for a connected graph to be bipartite (English)
0 references
10 February 2011
0 references
graph
0 references
bipartite
0 references
principal eigenvector
0 references
independent set
0 references
