DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Apollonian network
Apollonian network
The Number of Spanning Trees in Apollonian Networks
Dynamic Phenomena on Complex Networks Luca Dall’Asta
Stefan Felsnery Institut FUrmathematik Technische UniversitAtberlin
Building a Larger Class of Graphs for Efficient Reconfiguration
Some Properties of Random Apollonian Networks
Networks and Fractals Bsc Thesis
1. Relevant Standard Graph Theory
General Model for Apollonian Networks After T Gen- D New (D + 1)-Cliques with I As One Vertex of Them
Short Version Published in Electronic Notes in Discrete Mathematics
R, 44, 177 Abu-Khzam, Faisal N., 51 Agarwal, Pankaj K., 61, 190
Degree Distribution of Random Apollonian Network Structures and Boltzmann Sampling Alexis Darrasse, Michèle Soria
High Dimensional Apollonian Networks Zhongzhi Zhang, Francesc Comellas, Guillaume Fertin, Lili Rong
4-Connected Triangulations on Few Lines∗†
1 Color Fixation, Color Identity and the Four Color Theorem I Argue
Vertex Labeling and Routing in Expanded Apollonian Networks Zhongzhi Zhang, Francesc Comellas, Guillaume Fertin, Andr´Eraspaud, Lili Rong, Shuigeng Zhou
The Maximum Wiener Index of Maximal Planar Graphs
Network Geometry and Complexity
Wiener Indices of Maximal $ K $-Degenerate Graphs
Top View
Network Geometry and Complexity
Scalable Betweenness Centrality Maximization Via Sampling
Some Properties of Random Apollonian Networks
The Maximum Wiener Index of Maximal Planar Graphs
Embedded Width, a Variation of Treewidth for Planar Graphs
Long Paths in Random Apollonian Networks
Polygon-Based Hierarchical Planar Networks Based on Generalized Apollonian Construction
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks
Parallel Random Apollonian Networks 2
Analysis of Different Random Graph Models in the Identification of Network Motifs in Complex Networks
Arxiv:2102.02918V2 [Cs.DM] 11 Mar 2021
Diameter and Rumour Spreading in Real-World Network Models
Scale Free Properties of Random K-Trees
A Survey and Classification of Sierpinski-Type Graphs
Vertex Labeling and Routing for Farey-Type Symmetrically-Structured Graphs
Toughness and Hamiltonicity in Random Apollonian Networks
Vertex Labeling and Routing in Expanded Apollonian Networks
Characterizing Several Properties of High-Dimensional Random Apollonian Networks Panpan Zhang1