A computational approach to construct a multivariate complete graph invariant
From MaRDI portal
Publication:903598
DOI10.1016/J.INS.2013.11.008zbMATH Open1329.05279OpenAlexW2032261599MaRDI QIDQ903598FDOQ903598
Authors: Matthias Dehmer, Frank Emmert-Streib, Martin Grabner 
Publication date: 14 January 2016
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.11.008
Recommendations
- scientific article; zbMATH DE number 1539536
- On the reconstruction of graph invariants
- Algebraic invariants of graphs; a study based on computer exploration
- An invariant theory approach to graph enumeration
- A compilation of relations between graph invariants
- Inductive graph invariants and algorithmic applications
- A Rewriting Approach to Graph Invariants
- scientific article; zbMATH DE number 7301804
- INVARIANTS OF GRAPHS
- Inductive graph invariants and approximation algorithms
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Title not available (Why is that?)
- Graph energy
- Title not available (Why is that?)
- A Laplacian-energy-like invariant of a graph
- Title not available (Why is that?)
- On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
- Title not available (Why is that?)
- A history of graph entropy measures
- On extremal properties of graph entropies
- Title not available (Why is that?)
- The graph isomorphism disease
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Title not available (Why is that?)
- Engineering an efficient canonical labeling tool for large and sparse graphs
- Graph isomorphism problem
- A graph isomorphism algorithm for object recognition
- An Efficient Algorithm for Graph Isomorphism
- Graphs determined by polynomial invariants
- On Laplacian-energy-like invariant of a graph
- The Space Complexity of k-Tree Isomorphism
- Structural Analysis of Complex Networks
- Structural Analysis of Complex Networks
- Quantitative methods for ecological network analysis
- Graph-theoretical matrices in chemistry
- Title not available (Why is that?)
- Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation
- A Logspace Algorithm for Partial 2-Tree Canonization
- On Some Applications of Information Indices in Chemical Graph Theory
Cited In (18)
- The calculations of topological indices on certain networks
- Note on two generalizations of the Randić index
- Bounds for degree-based network entropies
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
- Maximum and minimum values of inverse degree and forgotten indices on the class of all unicyclic graphs
- Computing topological indices of the line graphs of banana tree graph and firecracker graph
- Computation of polarized metrized graph invariants by using discrete Laplacian matrix
- Entropy of weighted graphs with Randić weights
- INGRID: A graph invariant manipulator
- On the degeneracy of the Randić entropy and related graph measures
- Topological indices based on 2- or 3-eccentricity to predict anti-HIV activity
- Generalized permanental polynomials of graphs
- Network entropies based on independent sets and matchings
- Extremal values of matching energies of one class of graphs
- Graph measures with high discrimination power revisited: a random polynomial approach
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach
- Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial
- The effect of graph operations on the degree-based entropy
Uses Software
This page was built for publication: A computational approach to construct a multivariate complete graph invariant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q903598)
