The second neighborhood conjecture for oriented graphs missing $\{C_4, \overline{C}_4, S_3, \text{chair and co-chair}\}$-free graph.
Darine Al-MninySalman GhazalPublished in: Australas. J Comb. (2021)
Keyphrases
- neighborhood graph
- graph theory
- graph representation
- graph structure
- graph model
- directed graph
- graph databases
- graph theoretic
- labeled graphs
- graph matching
- weighted graph
- graph construction
- graph theoretical
- graph mining
- graph classification
- graph structures
- graph data
- graph partitioning
- bipartite graph
- graph properties
- undirected graph
- neighborhood structure
- graph clustering
- structural pattern recognition
- graph search
- adjacency matrix
- subgraph isomorphism
- graph isomorphism
- spanning tree
- graph transformation
- maximum common subgraph
- random walk
- minimum spanning tree
- series parallel
- dense subgraphs
- random graphs
- edge weights
- disk resident
- graph representations
- text mining
- knn
- graph drawing
- connected dominating set
- information retrieval
- association graph
- attributed graphs
- graph kernels
- directed acyclic graph
- real world graphs
- topological information
- planar graphs
- community discovery
- dynamic graph
- graph patterns
- minimal spanning tree
- inexact graph matching
- keywords