Results 31 to 40 of about 2,163,558 (289)
Total Minimal Dominating Signed Graph [PDF]
Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core +1 more source
ON TRANSINVERSE OF MATRICES AND ITS APPLICATIONS [PDF]
Given a matrix A with elements from a field of characteristic zero, the transin-verse A# of A is defined as the transpose of the matrix obtained by replacing the non-zero elements of A by their inverses and leaving zeros, if any, unchanged.We discuss the
Koombail Shahul Hameed +1 more
doaj +1 more source
A Hierarchical Parallel Graph Summarization Approach Based on Ranking Nodes
Graph summarization techniques are vital in simplifying and extracting enormous quantities of graph data. Traditional static graph structure-based summarization algorithms generally follow a minimum description length (MDL) style, and concentrate on ...
Qiang Liu, Jiaxing Wei, Hao Liu, Yimu Ji
doaj +1 more source
Graph convolution neural networks have shown powerful ability in recommendation, thanks to extracting the user-item collaboration signal from users’ historical interaction information.
Yang Li +4 more
doaj +1 more source
Deeper Exploiting Graph Structure Information by Discrete Ricci Curvature in a Graph Transformer
Graph-structured data, operating as an abstraction of data containing nodes and interactions between nodes, is pervasive in the real world. There are numerous ways dedicated to extract graph structure information explicitly or implicitly, but whether it ...
Xin Lai +4 more
doaj +1 more source
Secure Evaluation of Knowledge Graph Merging Gain
Finding out the differences and commonalities between the knowledge of two parties is an important task. Such a comparison becomes necessary, when one party wants to determine how much it is worth to acquire the knowledge of the second party, or similarly when two parties try to determine, whether a collaboration could be beneficial.
Leandro Eichenberger +3 more
openaire +3 more sources
In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core +1 more source
Line graphs of complex unit gain graphs with least eigenvalue -2
Let $\mathbb T$ be the multiplicative group of complex units, and let $\mathcal L (\Phi)$ denote a line graph of a $\mathbb{T}$-gain graph $\Phi$. Similarly to what happens in the context of signed graphs, the real number $\min Spec(A(\mathcal L (\Phi))$, that is, the smallest eigenvalue of the adjacency matrix of $\mathcal L(\Phi)$, is not less than $-
Belardo F., Brunetti M.
openaire +4 more sources
Towards a Maude tool for model checking temporal graph properties [PDF]
We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto +4 more
core +1 more source
This study aims to analyze the effect of the 5E learning cycle model assisted by LKPD based on a three-dimensional thinking graph on scientific reasoning and the improvement of scientific reasoning.
Hamidita Putri Ristia +2 more
doaj +1 more source

