Pages that link to "Item:Q1863531"
From MaRDI portal
The following pages link to A discrete nodal domain theorem for trees (Q1863531):
Displaying 13 items.
- Leaders in multi-agent controllability under consensus algorithm and tree topology (Q360669) (← links)
- On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes (Q424499) (← links)
- Minimum vertex covers and the spectrum of the normalized Laplacian on trees (Q432729) (← links)
- On eigenfunctions of Markov processes on trees (Q946489) (← links)
- A lower bound for nodal count on discrete and metric graphs (Q956633) (← links)
- On the isoperimetric spectrum of graphs and its approximations (Q974467) (← links)
- Graph Laplacians, nodal domains, and hyperplane arrangements (Q1886532) (← links)
- An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian (Q1931722) (← links)
- Approximations by graphs and emergence of global structures (Q2480644) (← links)
- Nodal domain count for the generalized graph \(p\)-Laplacian (Q2689133) (← links)
- Minimum supports of eigenfunctions of graphs: a survey (Q5888902) (← links)
- Symmetric matrices, signed graphs, and nodal domain theorems (Q6039199) (← links)
- Nodal domain theorems for \(p\)-Laplacians on signed graphs (Q6146940) (← links)
