A graph theoretical analysis of the number of edges in k-dense graphs

DOI10.5614/EJGTA.2016.4.1.4zbMath1467.05186arXiv1505.04300OpenAlexW2150649332MaRDI QIDQ5006573

No author found.

Publication date: 16 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.04300

zbMATH Keywords

\(k\)-core\(k\)-core subnetwork\(k\)-dense community\(k\)-dense graph\(k\)-dense subnetworks (or \(k\)-dense subgraph)

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

A generalization of a Turán’s theorem about maximum clique on graphs

Uses Software

• Unnamed Item
• Unnamed Item
• Traces

Cites Work

• Practical graph isomorphism. II.
• Reducibility among Combinatorial Problems

This page was built for publication: A graph theoretical analysis of the number of edges in k-dense graphs