Results 31 to 40 of about 180,088 (293)
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
Smarandache Directionally n-Signed Graphs — A Survey [PDF]
For graph theory terminology and notation in this paper we follow the book [3]. All graphs considered here are finite and simple.
P. Siva Kota Reddy, Reddy, P.Siva Kota
core +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 +2 more sources
The graph grabbing game on {0,1}-weighted graphs
The graph grabbing game is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the weights on them.
Soogang Eoh, Jihoon Choi
doaj +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
Negation Switching Equivalence in Signed Graphs [PDF]
Unless mentioned or defined otherwise, for all terminology and notion in graph theory the reader is refer to [8].
Reddy, Siva Kota
core +1 more source
Bond graphs in model matching control [PDF]
Bond graphs are primarily used in the network modeling of lumped parameter physical systems, but controller design with this graphical technique is relatively unexplored.
Ballance, D.J., Vink, D., Gawthrop, P.J.
core +1 more source
Let $\Phi=(G,U(\mathbb{Q}),\varphi)$ be a quaternion unit gain graph (or $U(\mathbb{Q})$-gain graph), where $G$ is the underlying graph of $\Phi$, $U(\mathbb{Q})=\{z\in \mathbb{Q}: |z|=1\}$ is the circle group, and $\varphi:\overrightarrow{E}\rightarrow ...
Zhou, Qiannan, Lu, Yong
core +1 more source
On the Characteristic Polynomial of Skew Gain Graphs
Gain graphs are graphs where the edges are given some orientation and labeled with the elements (called gains) from a group so that gains are inverted when we reverse the direction of the edges. Generalizing the notion of gain graphs, skew gain graphs have the property that the gain of a reversed edge is the image of edge gain under an anti-involution.
Hameed, K. S. +3 more
openaire +3 more sources
Enhancing cybersecurity through autonomous knowledge graph construction by integrating heterogeneous data sources [PDF]
Cybersecurity plays a critical role in today’s modern human society, and leveraging knowledge graphs can enhance cybersecurity and privacy in the cyberspace.
Hatoon Alharbi +3 more
doaj +2 more sources

