The maximum number of edges in a graph of bounded dimension, with applications to ring theory.
Geir AgnarssonStefan FelsnerWilliam T. TrotterPublished in: Discret. Math. (1999)
Keyphrases
- maximum number
- directed graph
- weighted graph
- spanning tree
- undirected graph
- directed acyclic graph
- edge weights
- random walk
- graph structure
- graph partitioning
- graph model
- bipartite graph
- connected components
- data sets
- general theory
- algebraic structure
- vertex set
- minimum cost
- edge information
- theoretical framework
- graph representation
- graph based algorithm
- massive graphs
- directed edges