The Crossing Numbers of Join of Special Disconnected Graph on Five Vertices with Discrete Graphs.
Marián KlescMichal StasJana PetrillováPublished in: Graphs Comb. (2022)
Keyphrases
- labeled graphs
- weighted graph
- adjacency matrix
- undirected graph
- random graphs
- edge weights
- graph representation
- maximum cardinality
- connected graphs
- planar graphs
- directed graph
- maximal cliques
- average degree
- hamiltonian cycle
- graph theory
- attributed graphs
- graph structure
- connected subgraphs
- bipartite graph
- graph partitioning
- graph matching
- query graph
- vertex set
- graph model
- directed edges
- subgraph isomorphism
- densely connected
- graph clustering
- graph theoretic
- graph structures
- graph kernels
- spanning tree
- shortest path
- graph data
- minimum weight
- graph classification
- betweenness centrality
- connected components
- graph theoretical
- graph databases
- series parallel
- graph construction
- graph patterns
- structural pattern recognition
- graph properties
- graph mining
- graph representations
- evolving graphs
- directed acyclic graph
- proximity graph
- graph mining algorithms
- maximum clique
- community discovery
- graph search
- reachability queries
- polynomial time complexity
- topological information
- minimum spanning tree
- small world
- community detection