A computational approach to construct a multivariate complete graph invariant

DOI10.1016/j.ins.2013.11.008zbMath1329.05279OpenAlexW2032261599MaRDI QIDQ903598

Frank Emmert-Streib, Matthias Dehmer, 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

zbMATH Keywords

statisticsinformation inequalityquantitative graph theoryrandom network model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (15)

Entropy of weighted graphs with Randić weights ⋮ Bounds for degree-based network entropies ⋮ Note on two generalizations of the Randić index ⋮ Computing topological indices of the line graphs of Banana tree graph and Firecracker graph ⋮ Maximum and minimum values of inverse degree and forgotten indices on the class of all unicyclic graphs ⋮ Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial ⋮ Graph measures with high discrimination power revisited: a random polynomial approach ⋮ Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach ⋮ On the degeneracy of the Randić entropy and related graph measures ⋮ Network entropies based on independent sets and matchings ⋮ Extremal values of matching energies of one class of graphs ⋮ The calculations of topological indices on certain networks ⋮ Topological indices based on 2- or 3-eccentricity to predict anti-HIV activity ⋮ Generalized permanental polynomials of graphs ⋮ The effect of graph operations on the degree-based entropy

Uses Software

• Mathematica
• nauty
• R
• QuACN
• bliss

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Laplacian-energy-like invariant of a graph
• A history of graph entropy measures
• On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
• Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation
• Graph isomorphism problem
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• A graph isomorphism algorithm for object recognition
• Graphs determined by polynomial invariants
• Quantitative methods for ecological network analysis
• A Logspace Algorithm for Partial 2-Tree Canonization
• Structural Analysis of Complex Networks
• The graph isomorphism disease
• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
• The Space Complexity of k-Tree Isomorphism
• On Some Applications of Information Indices in Chemical Graph Theory
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• An Efficient Algorithm for Graph Isomorphism

This page was built for publication: A computational approach to construct a multivariate complete graph invariant