Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-48749-6_13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Ordered Graphs and Large Bi-Cliques in Intersection Graphs of Curves

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

Orthodox Core–Heterodox Periphery? Contrasting Citation Networks of Economics Departments in Vienna

Review of Political Economy
EconomicsInternational RelationsEconometricsPolitical ScienceFinance
2018English

Community Core Evolution in Mobile Social Networks

The Scientific World Journal
BiochemistryMedicineGeneticsMolecular BiologyEnvironmental Science
2013English

Generalized Matrix Graphs and Completely Independent Critical Cliques in Any Dimension

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2012English

An Approach to Determination of Maximal Cliques in Undirected Graphs

International Journal of Modern Education and Computer Science
2018English

How Randomized Search Heuristics Find Maximum Cliques in Planar Graphs

2006English

Faster Sublinear Approximation of the Number of K-Cliques in Low-Arboricity Graphs

2020English

P_4-Decomposability in Regular Graphs and Multigraphs

English

Regular Graphs and Stability

Journal of the Australian Mathematical Society
Mathematics
1975English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy