arXiv (All)
open access
Drazin Inverses and Walk Structure of Oriented Dutch Windmill Graphs
We investigate the Drazin invertibility of adjacency matrices associated with a class of oriented graphs known as oriented Dutch windmill graphs. By analyzing walks of prescribed lengths and exploiting the structure of the minimal polynomial, we obtain explicit expressions for the Drazin inverse and
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Note on the Invertibility of Oriented Graphs#628825
- A proof of the Erdős--Gallai cycle decomposition conjecture#1217575
- Generalized Turán problem for directed cycles#1070682
- Connectivity keeping pendant extensions of paths in $k$-connected graphs and triangle-free graphs#1049373
- Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers#1118536
Record · ID 1217414
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive