Results 61 to 70 of about 1,238,875 (302)
Locally triangular graphs and rectagraphs with symmetry [PDF]
J. Combin. Theory, Ser. A. 133 (2015) 1-28, 2014 Locally triangular graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every $2$-arc lies in a unique quadrangle. A graph $\Gamma$ is locally rank 3 if there exists $G\leq \mathrm{Aut}(\Gamma)$ such that for each vertex $u$, the permutation group induced by the vertex stabiliser $G_u$ on the ...
arxiv +1 more source
Brain Sciences, 2022 The objective of this study was to characterize network-level changes in nonfluent/agrammatic Primary Progressive Aphasia (agPPA) and Primary Progressive Apraxia of Speech (PPAOS) with graph theory (GT) measures derived from scalp electroencephalography (
Rene L. Utianski +7 more
doaj +1 more source
Who is the best player ever? A complex network analysis of the history of professional tennis. [PDF]
PLoS ONE, 2011 We considered all matches played by professional tennis players between 1968 and 2010, and, on the basis of this data set, constructed a directed and weighted network of contacts.
Filippo Radicchi
doaj +1 more source
On the Geometric Interpretation of the Nonnegative Rank [PDF]
, 2010 The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors needed to reconstruct it exactly. The problem of determining this rank and computing the corresponding nonnegative factors is difficult; however it has ...
Aggarwal +31 more
core +2 more sources
Performance analysis of control allocation using data‐driven integral quadratic constraints
Advanced Control for Applications, Volume 4, Issue 4, December 2022., 2022 Abstract A new method is presented for evaluating the performance of a nonlinear control allocation system within a linear control loop. To that end, a worst‐case gain analysis problem is formulated that can be readily solved by means of well‐established methods from robustness analysis using integral quadratic constraints (IQCs).
Manuel Pusch +2 more
wiley +1 more source
A fractional approach to minimum rank and zero forcing [PDF]
, 2015 This thesis applies techniques from fractional graph theory to develop fractional versions of graph parameters related to minimum rank and zero forcing.
Palmowski, Kevin Francis
core +3 more sources
On rank-width of even-hole-free graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
1, Graph Theory (October 5, 2017) dmtcs:2575, 2016 We present a class of (diamond, even hole)-free graphs with no clique cutset that has unbounded rank-width. In general, even-hole-free graphs have unbounded rank-width, because chordal graphs are even-hole-free. A.A. da Silva, A. Silva and C. Linhares-Sales (2010) showed that planar even-hole-free graphs have bounded rank-width, and N.K.
arxiv +1 more source
q-Rung Orthopair Fuzzy Matroids with Application to Human Trafficking
Discrete Dynamics in Nature and Society, 2021 The theory of q-rung orthopair fuzzy sets (q-ROFSs) is emerging for the provision of more comprehensive and useful information in comparison to their counterparts like intuitionistic and Pythagorean fuzzy sets, especially when responding to the models of
Muhammad Asif +3 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
Procedia Engineering, 2015 AbstractThis paper presents three interconnected developments made during the course of a recent collective research work, the development of a systematic graph-based search tool for physical contradictions, a ranking approach for defining the order of criticality of the design contradictions and the associated analysis of the different design ...
Coatanéa, Eric +4 more
openaire +3 more sources