On a class of polynomials obtained from the circuits in a graph and its application to characteristics polynomials of graphs.
Edward J. FarrellPublished in: Discret. Math. (1979)
Keyphrases
- connected graphs
- graph representation
- graph theoretic
- graph theory
- graph matching
- graph structure
- labeled graphs
- graph model
- series parallel
- directed graph
- weighted graph
- graph mining
- graph search
- graph construction
- graph structures
- graph clustering
- graph databases
- graph partitioning
- undirected graph
- graph isomorphism
- graph theoretical
- planar graphs
- random graphs
- graph kernels
- small world
- subgraph isomorphism
- graph representations
- inexact graph matching
- graph transformation
- spanning tree
- high speed
- attributed graphs
- topological information
- graph classification
- directed acyclic graph
- adjacency graph
- adjacency matrix
- dynamic graph
- structural pattern recognition
- finding the shortest path
- bipartite graph