Results 31 to 40 of about 1,238,875 (302)
How to construct the symmetric cycle of length 5 using Haj\'os construction with an adapted Rank Genetic Algorithm [PDF]
In 2020 Bang-Jensen et. al. generalized the Haj\'os join of two graphs to the class of digraphs and generalized several results for vertex colorings in digraphs.
Juan Carlos García-Altamirano+2 more
doaj +1 more source
A ranking for the nodes of directed graphs based on game theory (Poster Presentation) [PDF]
AbstractWe introduce a value that allows us to emphasize the importance of each player in a cooperative game when the cooperation possibilities are limited according to the links of an oriented network. The proposed concept of accessibility tries to conjugate the marginal contributions of each node as a game player with the cooperation geometry imposed
José Miguel Giménez+2 more
openaire +2 more sources
K-theory for real k-graph C∗-algebras [PDF]
. We initiate the study of real C ∗ -algebras associated to higher-rank graphs Λ, with a focus on their K -theory. Following Kasparov and Evans, we identify a spectral sequence which computes the CR K -theory of C ∗ R (Λ , γ ) for any involution γ on Λ ...
Jeffrey L. Boersema, E. Gillaspy
semanticscholar +1 more source
We study the 3d N $$ \mathcal{N} $$ = 4 RG-flows triggered by Fayet-Iliopoulos deformations in unitary quiver theories. These deformations can be implemented by a new quiver algorithm which contains at its heart a problem at the intersection of linear ...
Antoine Bourget+2 more
doaj +1 more source
Ranks for families of regular graph theories
This article deals with families of regular graph theories. Using invariants of regular graph theory, a criterion for e-minimality,a-minimality, and α-minimality of subfamilies of the family of all regular graph theories is obtained. These ranks and degrees play a similar role for families of theories with hierarchies for definable theories, such as ...
N. D. Markhabatov, S. V. Sudoplatov
openaire +1 more source
TEST CASE PRIORITIZATION USING HYPERLINK RANKING - A GRAPH THEORY BASED APPROACH [PDF]
Era of cloud computing where majority of the applic ation is becoming web based enterprise computing. U ser prefer online web application for easy of use and business continuity [1]. Software companies have come up in huge numbe rs for developing web based enterprise application.
Krithika L. B+2 more
openaire +1 more source
The intensive deployment of cells in a wireless communication system may significantly increase the network capacity, but it may cause more complex and severe inter-cell interference.
Junxiang Gou+4 more
doaj +1 more source
Moving target defence (MTD) has been gaining traction to thwart false data injection attacks against state estimation (SE) in the power grid. MTD actively perturbs the reactance of transmission lines equipped with distributed flexible AC transmission ...
Bo Liu, Hongyu Wu
doaj +1 more source
A 5d perspective on the compactifications of 6d SCFTs to 4d N $$ \mathcal{N} $$ = 1 SCFTs
Compactifying 6d superconformal field theories (SCFTs) to 4d N $$ \mathcal{N} $$ = 1 theories on two-punctured spheres (tubes) and tori with flux is realized using duality domain walls in 5d N $$ \mathcal{N} $$ = 1 Kaluza-Klein (KK) theories, which are ...
Evyatar Sabag, Matteo Sacchi
doaj +1 more source
Real rank and topological dimension of higher rank graph algebras [PDF]
We study dimension theory for the $C^*$-algebras of row-finite $k$-graphs with no sources. We establish that strong aperiodicity - the higher-rank analogue of condition (K) - for a $k$-graph is necessary and sufficient for the associated $C^*$-algebra to
D. Pask, Adam Sierakowski, A. Sims
semanticscholar +1 more source