Results 31 to 40 of about 332,227 (273)
Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions [PDF]
, 2017 Fractional minimum positive semidefinite rank is defined from r-fold faithful orthogonal representations and it is shown that the projective rank of any graph equals the fractional minimum positive semidefinite rank of its complement.
Hogben, L +3 more
core +1 more source
Frontiers in Neuroscience, 2021 Objective: Graph theory applications are commonly used in connectomics research to better understand connectivity architecture and characterize its role in cognition, behavior and disease conditions. One of the numerous open questions in the field is how
Sahin Hanalioglu +9 more
doaj +1 more source
Shapley ratings in brain networks
Frontiers in Neuroinformatics, 2007 Recent applications of network theory to brain networks as well as the expanding empirical databases of brain architecture spawn an interest in novel techniques for analyzing connectivity patterns in the brain.
Rolf Kötter +7 more
doaj +1 more source
Three topological features of regulatory networks control life-essential and specialized subsystems
Scientific Reports, 2021 Gene regulatory networks (GRNs) play key roles in development, phenotype plasticity, and evolution. Although graph theory has been used to explore GRNs, associations amongst topological features, transcription factors (TFs), and systems essentiality are ...
Ivan Rodrigo Wolf +2 more
doaj +1 more source
Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
, 2015 Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing the rank of a divisor on a graph is NP-hard.
Kiss, Viktor, Tóthmérész, Lilla
core +1 more source
Twisted k-graph algebras associated to Bratteli diagrams [PDF]
, 2014 Given a system of coverings of k-graphs, we show that the cohomology of the resulting (k+1)-graph is isomorphic to that of any one of the k-graphs in the system. We then consider Bratteli diagrams of 2-graphs whose twisted C*-algebras are matrix algebras
A. An Huef +32 more
core +4 more sources
Determination of the Shortest Hamiltonian Paths in an Arbitrary Graph of Distributed Databases
Российский технологический журнал, 2019 A method has been developed for finding the shortest Hamiltonian path in an arbitrary graph based on the rank approach, which provides high efficiency and a significant reduction in the error in solving the problem of organizing the process of managing ...
E. G. Andrianova +2 more
doaj +1 more source
The Independence Number of the Orthogonality Graph in Dimension $2^k$ [PDF]
, 2019 We determine the independence number of the orthogonality graph on $2^k$-dimensional hypercubes. This answers a question by Galliard from 2001 which is motivated by a problem in quantum information theory.
Ihringer, Ferdinand, Tanaka, Hajime
core +4 more sources
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
Journal of Marine Science and Engineering, 2023 We aimed to improve the performance of ship detection methods in synthetic aperture radar (SAR) images by utilizing machine learning (ML) and artificial intelligence (AI) techniques.
Muhammad Yasir +5 more
doaj +1 more source