On the Crossing Numbers of the Joining of a Specific Graph on Six Vertices with the Discrete Graph.
Michal StasPublished in: Symmetry (2020)
Keyphrases
- adjacency matrix
- graph representation
- weighted graph
- graph model
- planar graphs
- random graphs
- graph partitioning
- directed graph
- labeled graphs
- hamiltonian cycle
- graph theory
- graph structure
- directed acyclic graph
- undirected graph
- bipartite graph
- maximum matching
- connected components
- random walk
- high level
- stable set
- directed edges
- vertex set
- attributed graphs
- graph data
- graph theoretic
- graph mining
- phase transition
- approximation algorithms
- bayesian networks