Timeline for Relation between nullity of components to its parent graph
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 2, 2018 at 15:45 | comment | added | Ranveer Singh | Actually, this relation also holds for directed graphs ( using weakly connected components ). But for the directed graph, using rank we cannot say about the number of zero eigenvalues. I was wondering if we somehow prove the above for undirected graph (without using rank), then using similar procedure we may say something about the number of zero eigenvalues for the directed case. | |
| Jan 2, 2018 at 15:14 | history | edited | YCor |
edited tags
|
|
| Jan 2, 2018 at 15:10 | comment | added | Arnaud Mortier | What is the motivation for not using the ranks of the graphs? | |
| Jan 2, 2018 at 15:00 | history | asked | Ranveer Singh | CC BY-SA 3.0 |