Graph characterization by counting sink star subgraphs
From MaRDI portal
Publication:2360843
DOI10.1007/s10851-016-0686-0zbMath1365.05286OpenAlexW2529225428MaRDI QIDQ2360843
Maedeh S. Tahaei, Seyed Naser Hashemi
Publication date: 29 June 2017
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-016-0686-0
polynomial coefficientssink star subgraphgraph characterizationgraphs similarityreduced Bartholdi zeta function
Other Dirichlet series and zeta functions (11M41) Graph theory (05C99) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- The coefficients of the reduced Bartholdi zeta function
- Graph kernels from the Jensen-Shannon divergence
- Correctness of linear logic proof structures is NL-complete
- Some properties of graphs determined by edge zeta functions
- A survey of graph edit distance
- Automatic learning of cost functions for graph edit distance
- The zeta function of a hypergraph
- Depth-based complexity traces of graphs
- The coefficients of the Ihara zeta function
- Generalized median graph computation by means of graph embedding in vector spaces
- Spectral embedding of graphs.
- Counting paths in graphs
- On the complexity of computing determinants
- Discriminative prototype selection methods for graph embedding
- Graph characteristics from the heat kernel trace
- Coined quantum walks lift the cospectrality of graphs and trees
- Properties determined by the Ihara zeta function of a graph
- Depth-based hypergraph complexity traces from directed line graphs
- Some weighted Bartholdi zeta function of a digraph
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- A generalized Bartholdi zeta function for a general graph
- Graph Classification and Clustering Based on Vector Space Embedding
- Computing Partitions with Applications to the Knapsack Problem
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
- ARTIN TYPE L-FUNCTIONS AND THE DENSITY THEOREM FOR PRIME CYCLES ON FINITE GRAPHS
- A Fast Matching Algorithm for Graph-Based Handwriting Recognition
- Graph-Based Representations in Pattern Recognition
- Graph-Theoretic Techniques for Web Content Mining
- Discrete Geometry for Computer Imagery
This page was built for publication: Graph characterization by counting sink star subgraphs