Results 21 to 30 of about 287 (207)
On the N-spectrum of oriented graphs
Open Mathematics, 2020 Given any digraph D, its non-negative spectrum (or N-spectrum, shortly) consists of the eigenvalues of the matrix AA T, where A is the adjacency matrix of D.
Abudayah Mohammad +2 more
doaj +1 more source
Adjacent Channel Coexistence of LTE in Unlicensed Spectrum
The Journal of Korean Institute of Communications and Information Sciences, 2015 This paper evaluates the adjacent channel coexistence issues between LAA(License Assisted Access) system and other system (e.g. Wi-Fi) system in 5 GHz unlicensed spectrum. LAA is a technology to achieve enhanced data rate by aggregating licensed and unlicensed spectrum using CA(Carrier Aggregation).
Su Hwan Lim +2 more
openaire +2 more sources
On a version of the spectral excess theorem
Electronic Journal of Graph Theory and Applications, 2020 Given a regular (connected) graph G=(X,E) with adjacency matrix A, d+1 distinct eigenvalues, and diameter D, we give a characterization of when its distance matrix AD is a polynomial in A, in terms of the adjacency spectrum of G and the arithmetic (or ...
Miquel Àngel Fiol, Safet Penjic
doaj +1 more source
Adjacency Sequence and Adjacency Spectrum of Power Fuzzy Graphs
Indian Journal Of Science And TechnologyObjectives: To find the adjacency sequence, spectrum of the power fuzzy graphs and discuss its properties. Methods: The spectrum and energy of the power fuzzy graphs are derived using the adjacency matrices. Energy of the power fuzzy graph is computed by adding the absolute eigenvalues of the adjacency matrix.
S Shiny Paulin, T Bharathi
openaire +2 more sources
Spectrum of Adjacency Matrix of Graphs in Cryptography
, 2023 Abstract Having access to an elliptic curve with a specified number of points over a specific finite field isa prerequisite for many contemporary cryptography systems. The isogenies, which are surjectivemorphisms, play a significant role as specific mappings between these curves.
openaire +1 more source
On the Spectral Characterizations of Graphs
Discussiones Mathematicae Graph Theory, 2017 Several matrices can be associated to a graph, such as the adjacency matrix or the Laplacian matrix. The spectrum of these matrices gives some informations about the structure of the graph and the question “Which graphs are determined by their spectrum?”
Huang Jing, Li Shuchao
doaj +1 more source
The Aα-spectral radius of complements of bicyclic and tricyclic graphs with n vertices
Special Matrices, 2021 Recently, the extremal problem of the spectral radius in the class of complements of trees, unicyclic graphs, bicyclic graphs and tricyclic graphs had been studied widely.
Chen Chaohui +2 more
doaj +1 more source
Determining Graphs by the Complementary Spectrum
Discussiones Mathematicae Graph Theory, 2020 The complementary spectrum of a connected graph G is the set of the complementary eigenvalues of the adjacency matrix of G. In this note, we discuss the possibility of representing G using this spectrum.
Pinheiro Lucélia K. +2 more
doaj +1 more source
Ural Mathematical Journal, 2021 The vertex distance complement (VDC) matrix \(\textit{C}\), of a connected graph \(G\) with vertex set consisting of \(n\) vertices, is a real symmetric matrix \([c_{ij}]\) that takes the value \(n - d_{ij}\) where \(d_{ij}\) is the distance between the
Ann Susa Thomas +2 more
doaj +1 more source
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS Letters, EarlyView.We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source