New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\) (Q2068829): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: General results on preferential attachment and clustering coefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communities in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Graph Clusterings with Maximum Modularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Modularity of Some Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum modular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of regular and treelike graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity in several random graph models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isoperimetric number of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of Erdős‐Rényi random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to Borsuk’s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact modularity of line graphs of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bound on the modularity of Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s0032946021040086 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4206785270 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:40, 30 July 2024

scientific article
Language Label Description Also known as
English
New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
scientific article

    Statements

    New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\) (English)
    0 references
    0 references
    0 references
    20 January 2022
    0 references
    modularity
    0 references
    Johnson graphs
    0 references
    clusterization
    0 references
    random graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references