Results 21 to 30 of about 176,563 (257)

Certain operations on interval-valued picture fuzzy graphs with application

open access: yesInternational Journal of Mathematics for Industry, 2023
Graph theory has various applications in computer science, such as image segmentation, clustering, data mining, image capturing, and networking. Fuzzy graph (FG) theory has been widely adopted to handle uncertainty in graph-related problems.
Biswajit Das Adhikari   +3 more
doaj   +1 more source

A Hierarchical Parallel Graph Summarization Approach Based on Ranking Nodes

open access: yesApplied Sciences, 2023
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 Gain: A Concave-Hull Based Volumetric Gain for Robotic Exploration

open access: yesCoRR, 2022
The existing volumetric gain for robotic exploration is calculated in the 3D occupancy map, while the sampling-based exploration method is extended in the reachable (free) space. The inconsistency between them makes the existing calculation of volumetric gain inappropriate for a complete exploration of the environment. To address this issue, we propose
Zezhou Sun   +3 more
openaire   +2 more sources

Multi-Behavior Enhanced Heterogeneous Graph Convolutional Networks Recommendation Algorithm based on Feature-Interaction

open access: yesApplied Artificial Intelligence, 2023
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

open access: yesEntropy, 2023
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

ON TRANSINVERSE OF MATRICES AND ITS APPLICATIONS [PDF]

open access: yesJournal of Algebraic Systems
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

Oriented gain graphs, line graphs and eigenvalues [PDF]

open access: yesLinear Algebra and its Applications, 2016
A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of gain graphs with complex units, matrix properties are established.
openaire   +3 more sources

Model Learning Cycle 5E Berbantuan LKPD Berbasis Three-Dimensional Thinking Graph dan Pengaruhnya Terhadap Scientific Reasoning Pada Siswa SMP

open access: yesJurnal Paedagogy, 2023
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

Secure Evaluation of Knowledge Graph Merging Gain

open access: yesCoRR, 2021
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   +2 more sources

Line graphs of complex unit gain graphs with least eigenvalue -2

open access: yesThe Electronic Journal of Linear Algebra, 2021
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

Home - About - Disclaimer - Privacy