Results 41 to 50 of about 113,956 (308)
The General Extended Adjacency Eigenvalues of Chain Graphs
MathematicsIn this article, we discuss the spectral properties of the general extended adjacency matrix for chain graphs. In particular, we discuss the eigenvalues of the general extended adjacency matrix of the chain graphs and obtain its general extended ...
Bilal Ahmad Rather +3 more
doaj +1 more source
Applied Sciences, 2022 Adjacency matrix visualization is a common method for presenting graph data, and the Focus+Context technique can be used to explore the details of the ROI (region of interest).
Tiemeng Li +3 more
doaj +1 more source
aMatReader: Importing adjacency matrices via Cytoscape Automation [version 1; referees: 2 approved]
F1000Research, 2018 Adjacency matrices are useful for storing pairwise interaction data, such as correlations between gene pairs in a pathway or similarities between genes and conditions. The aMatReader app enables users to import one or multiple adjacency matrix files into
Brett Settle +3 more
doaj +1 more source
On the adjacency matrix of a threshold graph [PDF]
Linear Algebra and its Applications, 2013 Abstract A threshold graph on n vertices is coded by a binary string of length n − 1 . We obtain a formula for the inertia of (the adjacency matrix of) a threshold graph in terms of the code of the graph. It is shown that the number of negative eigenvalues of the adjacency matrix of a threshold graph is the number of ones in the code, whereas ...
openaire +1 more source
aMatReader: Importing adjacency matrices via Cytoscape Automation [version 2; referees: 2 approved]
F1000Research, 2018 Adjacency matrices are useful for storing pairwise interaction data, such as correlations between gene pairs in a pathway or similarities between genes and conditions. The aMatReader app enables users to import one or multiple adjacency matrix files into
Brett Settle +3 more
doaj +1 more source
Graph Spectral Properties of Deterministic Finite Automata
, 2014 We prove that a minimal automaton has a minimal adjacency matrix rank and a minimal adjacency matrix nullity using equitable partition (from graph spectra theory) and Nerode partition (from automata theory). This result naturally introduces the notion of
A. Goldberg +5 more
core +1 more source
Fuzzy Adjacency Matrix In Graphs
, 2011 In this paper a new definition of adjacency matrix in the simple graphs is presented that is called fuzzy adjacency matrix, so that elements of it are in the form of 0 and n N n 1 , ∈ that are in the interval [0, 1], and then some charactristics of this matrix are presented with the related examples .
Taheri, Mahdi, Mehrana Niroumand
openaire +1 more source
On the determinant of the adjacency matrix for a planar sublattice
Journal of Combinatorial Theory, Series B, 1983 AbstractIt is proved that the determinant of the adjacency matrix for a finite subgraph G of Z × Z is 1, 0, or −1, provided that G has no “holes.”
Carlos Tomei, Carlos Tomei, Percy Deift
openaire +2 more sources
On α-adjacency energy of graphs and Zagreb index
AKCE International Journal of Graphs and Combinatorics, 2021 Let A(G) be the adjacency matrix and D(G) be the diagonal matrix of the vertex degrees of a simple connected graph G. Nikiforov defined the matrix of the convex combinations of D(G) and A(G) as for If are the eigenvalues of (which we call α-adjacency ...
S. Pirzada +3 more
doaj +1 more source
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs
Journal of Mathematics, 2016 Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
doaj +1 more source