Extremal Values for the Maximum Degree in a Twin-Free Graph.
Irène CharonOlivier HudryAntoine LobsteinPublished in: Ars Comb. (2012)
Keyphrases
- graph theory
- graph structure
- structured data
- parameter values
- graph representation
- random graphs
- random walk
- graph theoretic
- directed graph
- clustering coefficient
- directed acyclic graph
- attribute values
- social network analysis
- minimum spanning tree
- graph based algorithm
- maximally stable
- degree distribution
- semi supervised
- maximum number
- graph databases
- graph model
- pixel values
- bipartite graph
- connected components
- markov random field