On the independence number and the chromatic number of generalized preferential attachment models (Q2197436): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2020.04.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3035506051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large communities in a scale-free network / rank
 
Normal rank
Property / cites work
 
Property / cites work: PageRank in Undirected Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex networks: structure and dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degree sequence of a scale-free random graph process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popularity based random graph models leading to a scale-free degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings and Hamiltonian cycles in the preferential attachment model / rank
 
Normal rank
Property / cites work
 
Property / cites work: About the Power Law of the PageRank Vector Component Distribution. Part 2. The Buckley–Osthus Model, Verification of the Power Law for This Model, and Setup of Real Search Engines / rank
 
Normal rank
Property / cites work
 
Property / cites work: About the Power Law of the PageRank Vector Component Distribution. Part 1. Numerical Methods for Finding the PageRank Vector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering coefficient of a spatial preferential attachment model / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for the clique-chromatic numbers of Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Clustering Coefficient in Generalized Preferential Attachment Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assortativity in generalized preferential attachment models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local clustering coefficients in preferential attachment models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Kneser graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Degree of the Barabási–Albert Random Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity in several random graph models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of complex networks models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of random subgraphs of a certain distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On threshold probability for the stability of independent sets in distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of the independence number of a random subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small subgraphs in preferential attachment networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on clique-chromatic numbers of Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique chromatic numbers of intersection graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:34, 23 July 2024

scientific article
Language Label Description Also known as
English
On the independence number and the chromatic number of generalized preferential attachment models
scientific article

    Statements

    On the independence number and the chromatic number of generalized preferential attachment models (English)
    0 references
    31 August 2020
    0 references
    networks
    0 references
    preferential attachment
    0 references
    random graph models
    0 references
    independence number
    0 references
    chromatic number
    0 references

    Identifiers

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