Further study of eccentricity based indices for benzenoid hourglass network
Topological Indices are the mathematical estimate related to atomic graph that corresponds biological structure with several real properties and chemical activities. These indices are invariant of graph under graph isomorphism.
Hifza Iqbal +6 more
doaj +1 more source
Spectrally Robust Graph Isomorphism [PDF]
We initiate the study of spectral generalizations of the graph isomorphism problem. b) The Spectral Graph Dominance (SGD) problem: On input of two graphs G and H does there exist a permutation pi such that G preceq pi(H)?
Kolla, Alexandra +3 more
core +1 more source
A Graph Isomorphism Network with Weighted Multiple Aggregators for Speech Emotion Recognition
Speech emotion recognition (SER) is an essential part of human-computer interaction. In this paper, we propose an SER network based on a Graph Isomorphism Network with Weighted Multiple Aggregators (WMA-GIN), which can effectively handle the problem of ...
Hu, Ying +3 more
core +1 more source
Graph Isomorphism and Hybrid-Order Residual Gated Graph Neural Network for Session-Based Recommendation [PDF]
Session-based recommendation aims to predict which item will be clicked next for the current session. Aiming at the shortcomings of existing session recommendation models based on graph neural network, this paper proposes a model named graph isomorphism ...
WANG Yonggui, YU Qi
doaj +1 more source
QuateXelero : an accelerated exact network motif detection algorithm
Finding motifs in biological, social, technological, and other types of networks has become a widespread method to gain more knowledge about these networks’ structure and function.
Dichter, Norbert +9 more
core +1 more source
Interaction graphs of isomorphic automata networks I: Complete digraph and minimum in-degree
An automata network with $n$ components over a finite alphabet $Q$ of size $q$ is a discrete dynamical system described by the successive iterations of a function $f:Q^n\to Q^n$. In most applications, the main parameter is the interaction graph of $f$: the digraph with vertex set $[n]$ that contains an arc from $j$ to $i$ if $f_i$ depends on input $j$.
Bridoux, Florian +3 more
openaire +4 more sources
We consider the size and structure of the automorphism groups of a variety of empirical ‘real-world’ networks and find that, in contrast to classical random graph models, many real-world networks are richly symmetric.
Sanchez-Garcia, Ruben J. +2 more
core +1 more source
Analyzing single-valued neutrosophic fuzzy graphs through matroid perspectives
We hope to present this paper on the emergence of a novel category of matroids derived from single-valued neutrosophic (SVN) fuzzy-graphs. The findings of this study make a substantial contribution to both matroid theory and the field of neutrosophic ...
S.M. Balaji, D. Meiyappan, R. Sujatha
doaj +1 more source
Investigating Hypernode Classification of Complex Systems Based on High-order Graph Neural Networks
Investigating latent interactions beyond direct connections is essential for analyzing complex networks. However, traditional graph structures often fail to capture complex relationships, especially in the high-order interactions among multiple ...
Jiawen Chen +3 more
doaj +1 more source
Improved Lipophilicity and Aqueous Solubility Prediction with Composite Graph Neural Networks
The accurate prediction of molecular properties, such as lipophilicity and aqueous solubility, are of great importance and pose challenges in several stages of the drug discovery pipeline.
Oliver Wieder +6 more
doaj +1 more source

