On the extremal values of the number of vertices with an interval spectrum on the set of proper edge colorings of the graph of the $n$-dimensional cube.
A. M. KhachatryanRafayel R. KamalianPublished in: CoRR (2013)
Keyphrases
- undirected graph
- small number
- weighted graph
- random graphs
- maximum number
- graph theory
- fixed number
- vertex set
- multi dimensional
- edge weights
- attributed graphs
- user defined
- stable set
- labeled graphs
- adjacency matrix
- real numbers
- minimum cost
- graph model
- bipartite graph
- approximation algorithms
- directed graph
- selected subset
- polynomial time complexity
- directed edges
- highly correlated
- graph representation
- computational complexity
- directed acyclic graph
- connected components
- complex networks
- social network analysis
- probability distribution