A graph theoretical analysis of the number of edges in k-dense graphs
<p>Due to the increasing discovery and implementation of networks within all disciplines of life, the study of subgraph connectivity has become increasingly important. Motivated by the idea of community (or subgraph) detection within a network/graph, we focused on finding characterizations of...
Main Authors: | Linda Eroh, Henry Escuadro, Ralucca Gera, Samuel Prahlow, Karl Schmitt |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2016-04-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/113 |
Similar Items
-
Dense subgraph mining in probabilistic graphs
by: Esfahani, Fatemeh
Published: (2021) -
Fast and Efficient Radio Resource Allocation in Dynamic Ultra-Dense Heterogeneous Networks
by: Chongyu Niu, et al.
Published: (2017-01-01) -
Fast Algorithms for Large-Scale Network Analytics
by: Sariyuce, Ahmet Erdem
Published: (2015) -
Discovering Hierarchical Subgraphs of K-Core-Truss
by: Zhenjun Li, et al.
Published: (2018-07-01) -
M_{2}-edge colorings of dense graphs
by: Jaroslav Ivančo
Published: (2016-01-01)