On the crossing number of join product of the discrete graph with special graphs of order five.
Michal StasPublished in: Electron. J. Graph Theory Appl. (2020)
Keyphrases
- random graphs
- finite number
- graph structure
- graph representation
- undirected graph
- graph theoretic
- graph partitioning
- random walk
- connected graphs
- cartesian product
- adjacency matrix
- graph clustering
- graph databases
- weighted graph
- bipartite graph
- directed graph
- query processing
- graph mining
- edge weights
- graph data
- graph theory
- graph matching
- graph embedding
- series parallel
- attributed graphs
- graph isomorphism
- nodes of a graph