Pages that link to "Item:Q3654248"
From MaRDI portal
The following pages link to Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks (Q3654248):
Displaying 7 items.
- The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs (Q1672982) (← links)
- Structure properties of Koch networks based on networks dynamical systems (Q2012816) (← links)
- Vertex labeling and routing for Farey-type symmetrically-structured graphs (Q2333775) (← links)
- Comparing classical and quantum pageranks (Q2411569) (← links)
- Self-similar non-clustered planar graphs as models for complex networks (Q3600536) (← links)
- The Tutte polynomial of a class of compound graphs and its applications (Q6174137) (← links)
- Distance-edge-monitoring sets of networks (Q6541036) (← links)