Pages that link to "Item:Q1025536"
From MaRDI portal
The following pages link to Number of walks and degree powers in a graph (Q1025536):
Displaying 18 items.
- Inequalities for the number of walks in graphs (Q378237) (← links)
- Graph homomorphisms between trees (Q463048) (← links)
- Extremality of degree-based graph entropies (Q506695) (← links)
- Influence of assortativity and degree-preserving rewiring on the spectra of networks (Q614567) (← links)
- Enumeration of acyclic walks in a graph (Q686419) (← links)
- The number of walks in a graph (Q1431887) (← links)
- Degree powers in \(K_{s,t}\)-minor free graphs (Q2075529) (← links)
- Ordering starlike trees by the totality of their spectral moments (Q2140999) (← links)
- The maximum outdegree power of complete \(k\)-partite oriented graphs (Q2161905) (← links)
- A note on the invariant factors of the walk matrix of a graph (Q2238879) (← links)
- Comparing large-scale graphs based on quantum probability theory (Q2279341) (← links)
- Bounds on the number of closed walks in a graph and its applications (Q2405633) (← links)
- Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling (Q4575405) (← links)
- On the spectral invariants of symmetric matrices with applications in the spectral graph theory (Q5161717) (← links)
- On local weak limit and subgraph counts for sparse random graphs (Q5868527) (← links)
- A new proof of the Erdős-Simonovits conjecture on walks (Q6045135) (← links)
- Lower and upper bounds on graph communicabilities (Q6602318) (← links)
- The outdegree power of oriented graphs (Q6653949) (← links)
