Extremal graphs without long paths and a given graph.
Yichong LiuLiying KangPublished in: Discret. Math. (2024)
Keyphrases
- graph theory
- graph theoretical
- graph representation
- graph theoretic
- graph properties
- graph mining
- graph matching
- labeled graphs
- graph structure
- graph construction
- directed graph
- graph databases
- graph classification
- adjacency matrix
- graph clustering
- weighted graph
- graph structures
- graph representations
- graph model
- minimum spanning tree
- graph partitioning
- undirected graph
- subgraph isomorphism
- random graphs
- graph isomorphism
- maximum independent set
- bipartite graph
- graph search
- spanning tree
- maximal cliques
- evolving graphs
- shortest path
- maximum clique
- reachability queries
- dynamic graph
- graph transformation
- series parallel
- graph embedding
- graph data
- real world graphs
- maximum cardinality
- directed acyclic
- structural pattern recognition
- social network analysis
- maximum common subgraph
- inexact graph matching
- structured data
- complex networks
- graph patterns
- graph drawing
- dense subgraphs
- social graphs
- disk resident
- graph layout
- average degree
- edge weights
- adjacency graph
- random walk
- vertex set