Results 11 to 20 of about 30,707 (261)

On the Adjacency Matrix of RyR2 Cluster Structures. [PDF]

open access: yesPLoS Comput Biol, 2015
In the heart, electrical stimulation of cardiac myocytes increases the open probability of sarcolemmal voltage-sensitive Ca2+ channels and flux of Ca2+ into the cells. This increases Ca2+ binding to ligand-gated channels known as ryanodine receptors (RyR2).
Walker MA   +5 more
europepmc   +7 more sources

Adjacency Matrix of a Semigraph

open access: yesElectronic Notes in Discrete Mathematics, 2017
Abstract Semigraph was defined by Sampathkumar as a generalization of a graph. In this paper the adjacency matrix which represents semigraph uniquely and a characterization of such a matrix is obtained. An algorithm to construct the semigraph from a given square matrix, if semigraphical is given.
Y. S. Gaidhani   +2 more
exaly   +2 more sources

Clustering Based on Eigenvectors of the Adjacency Matrix

open access: yesInternational Journal of Applied Mathematics and Computer Science, 2018
The paper presents a novel spectral algorithm EVSA (eigenvector structure analysis), which uses eigenvalues and eigenvectors of the adjacency matrix in order to discover clusters.
Lucińska Małgorzata   +1 more
doaj   +2 more sources

General Zagreb adjacency matrix [PDF]

open access: yesContributions to Mathematics, 2022
Zhen Lin
doaj   +2 more sources

Rank-GCN for Robust Action Recognition

open access: yesIEEE Access, 2022
We present a robust skeleton-based action recognition method with graph convolutional network (GCN) that uses the new adjacency matrix, called Rank-GCN. In Rank-GCN, the biggest change from previous approaches is how the adjacency matrix is generated to ...
Haetsal Lee   +3 more
doaj   +1 more source

The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs

open access: yesTheory and Applications of Graphs, 2023
The α-Hermitian adjacency matrix Hα of a mixed graph X has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number α.
Omar Alomari   +2 more
doaj   +1 more source

Anti-Adjacency Matrices of Certain Graphs Derived from Some Graph Operations

open access: yesRatio Mathematica, 2023
If we go through the literature, one can find many matrices that are derived for a given simple graph. The one among them is the anti-adjacency matrix which is given as follows; The anti-adjacency matrix of a simple undirected graph $G$ with vertex set   
Manju V N, Athul T B, Suresh Singh G
doaj   +1 more source

Relationship between adjacency and distance matrix of graph of diameter two

open access: yesIndonesian Journal of Combinatorics, 2021
The relationship among every pair of vertices in a graph can be represented as a matrix, such as in adjacency matrix and distance matrix. Both adjacency and distance matrices have the same property.
Siti L. Chasanah   +3 more
doaj   +1 more source

Some New Bounds for α-Adjacency Energy of Graphs

open access: yesMathematics, 2023
Let G be a graph with the adjacency matrix A(G), and let D(G) be the diagonal matrix of the degrees of G. Nikiforov first defined the matrix Aα(G) as Aα(G)=αD(G)+(1−α)A(G), 0≤α≤1, which shed new light on A(G) and Q(G)=D(G)+A(G), and yielded some ...
Haixia Zhang, Zhuolin Zhang
doaj   +1 more source

A Note on the Estrada Index of the Aα-Matrix

open access: yesMathematics, 2021
Let G be a graph on n vertices. The Estrada index of G is an invariant that is calculated from the eigenvalues of the adjacency matrix of a graph. V. Nikiforov studied hybrids of A(G) and D(G) and defined the Aα-matrix for every real α∈[0,1] as: Aα(G)=αD(
Jonnathan Rodríguez, Hans Nina
doaj   +1 more source

Home - About - Disclaimer - Privacy