The crossing numbers of join of the special graph on six vertices with path and cycle.
Marián KlescPublished in: Discret. Math. (2010)
Keyphrases
- weighted graph
- edge weights
- shortest path
- strongly connected
- bipartite graph
- undirected graph
- maximum matching
- labeled graphs
- solution path
- random graphs
- directed edges
- planar graphs
- adjacency matrix
- graph theoretic
- directed graph
- minimum weight
- random walk
- hamiltonian cycle
- graph structure
- vertex set
- attributed graphs
- spanning tree
- shortest path problem
- graph partitioning
- query graph
- cartesian product
- graph theory
- path length
- query optimization
- stable set
- structured data
- connected components
- maximal cliques
- graph search
- query processing
- connected subgraphs
- maximum cardinality
- connected graphs
- join operations