Graph disjointness is characterized by spectral overlap of Markov transition matrices and tree structures, depending only on vertex and edge sets rather than weights.
Prentice hall Upper Saddle River, 2001
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Arithmetical structures on ladder and grid graphs are characterized through structural properties and enumeration patterns derived from the defining matrix equation.
Quantum state transfer via discrete-time quantum walks occurs on butterfly graphs and is robust to unital and non-unital noises.
citing papers explorer
-
Graph Disjointness with Applications to Reversible Markov Chains
Graph disjointness is characterized by spectral overlap of Markov transition matrices and tree structures, depending only on vertex and edge sets rather than weights.
-
Arithmetical Structures on Ladder Graphs
Arithmetical structures on ladder and grid graphs are characterized through structural properties and enumeration patterns derived from the defining matrix equation.
-
Quantum state transfer on a scalable network under unital and non-unital noise
Quantum state transfer via discrete-time quantum walks occurs on butterfly graphs and is robust to unital and non-unital noises.