Results 51 to 60 of about 116,552 (326)

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, Bilal A. Rather, Hilal A. Ganie, Rezwan ul Shaban   +3 more
doaj   +1 more source

Mapping the evolution of mitochondrial complex I through structural variation

FEBS Letters, EarlyView.
Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin, Tingting Chen, James A. Letts   +2 more
wiley   +1 more source

KAMG: A Tool for Converting Blood Ties and Affinity Ties into Adjacency Matrices

Journal of Open Research Software, 2016
Kinship Adjacency Matrix Generator (KAMG) is a browser-based software for creating adjacency matrices using the information of kinship ties. Specifically, it is capable of converting the family trees in the format of GEDCOM files into adjacency matrices ...
Hang Xiong, Pin Xiong, Hui Xiong
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

Photosynthesis under far‐red light—evolutionary adaptations and bioengineering of light‐harvesting complexes

FEBS Letters, EarlyView.
Phototrophs evolved light‐harvesting systems adapted for efficient photon capture in habitats enriched in far‐red radiation. A subset of eukaryotic pigment‐binding proteins can absorb far‐red photons via low‐energy chlorophyll states known as red forms.
Antonello Amelii, Edoardo Andrea Cutolo, Daniele Montepietra, Claudia Battarra, Roberto Caferri, Stefano Capaldi, Zeno Guardini, Luca Dall'Osto, Roberto Bassi   +8 more
wiley   +1 more source

An algebraic analysis of the graph modularity

, 2014
One of the most relevant tasks in network analysis is the detection of community structures, or clustering. Most popular techniques for community detection are based on the maximization of a quality function called modularity, which in turn is based upon
Fasino, Dario, Tudisco, Francesco
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

Chemoresistome mapping in individual breast cancer patients unravels diversity in dynamic transcriptional adaptation

Molecular Oncology, EarlyView.
This study used longitudinal transcriptomics and gene‐pattern classification to uncover patient‐specific mechanisms of chemotherapy resistance in breast cancer. Findings reveal preexisting drug‐tolerant states in primary tumors and diverse gene rewiring patterns across patients, converging on a few dysregulated functional modules. Despite receiving the
Maya Dadiani, Gilgi Friedlander, Gili Perry, Nora Balint‐Lahat, Shlomit Gilad, Dana Morzaev‐Sulzbach, Anjana Shenoy, Noa Bossel Ben‐Moshe, Anya Pavlovsky, Rinat Bernstein‐Molho, Eytan Domany, Iris Barshack, Tamar Geiger, Bella Kaufman, Einav Nili Gal‐Yam   +14 more
wiley   +1 more source

A new matrix representation of multidigraphs

AKCE International Journal of Graphs and Combinatorics, 2020
In this article, we introduce a new matrix associated with a multidigraph, named as the complex adjacency matrix. We study the spectral properties of bipartite multidigraphs corresponding to the complex adjacency matrix.
Sasmita Barik, Gopinath Sahoo
doaj   +1 more source

The spectra of the adjacency matrix and Laplacian matrix for some balanced trees

Linear Algebra and its Applications, 2005
The authors express the spectra of the adjacency and the Laplacian matrices of an unweighted rooted tree of \(k\) levels, such that in each level the vertices have the same degree, in terms of the spectra of a set of symmetric tridiagonal matrices.
Rojo, O, Soto, R
openaire   +5 more sources