Results 101 to 110 of about 1,011,259 (278)
Non-vanishing of Betti numbers of edge ideals and complete bipartite subgraphs [PDF]
, 2014 Given a finite simple graph one can associate the edge ideal. In this paper we prove that a graded Betti number of the edge ideal does not vanish if the original graph contains a set of complete bipartite subgraphs with some conditions.
Kimura, Kyouko
core
Unveiling Hidden Features of Strongly Correlated Quantum Systems Through a Complex‐Network Analysis
Advanced Quantum Technologies, EarlyView.By applying complex network theory, we report a fundamental and previously unobserved phenomenon in the finite‐size Kitaev model: a singular point at which uniform, nonzero entanglement emerges among all fermion pairs, forming a complete entanglement network.
Guillem Llodrà +2 more
wiley +1 more source
Cyclability in bipartite graphs [PDF]
Opuscula Mathematica, 2009 Let \(G=(X,Y,E)\) be a balanced \(2\)-connected bipartite graph and \(S \subset V(G)\). We will say that \(S\) is cyclable in \(G\) if all vertices of \(S\) belong to a common cycle in \(G\).
Denise Amar +2 more
doaj +1 more source
Adaptive Dynamic Bipartite Graph Matching: A Reinforcement Learning Approach
IEEE International Conference on Data Engineering, 2019 Online bipartite graph matching is attracting growing research attention due to the development of dynamic task assignment in sharing economy applications, where tasks need be assigned dynamically to workers.
Yansheng Wang +5 more
semanticscholar +1 more source
The coevolution of board interlock networks and corporate strategic actions
Strategic Management Journal, EarlyView.Abstract Research Summary Studies on board interlock networks are divided into two streams, one examining their dynamics; the other, their consequences. We propose that both phenomena—board interlock dynamics and consequences—are interdependent. Applying structuration theory, we explain and empirically demonstrate how firms' corporate strategic actions
Steffen Triebel +2 more
wiley +1 more source
Unbalanced bipartite factorizations of complete bipartite graphs [PDF]
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie +5 more
wiley +1 more source
Insect Science, EarlyView.A multilocus sequence typing approach is proposed to explore Halymorpha halys genetic diversity, taking into consideration both insect nuclear markers and markers from the gut symbiont “Candidatus Pantoa carbekii.” Increased information was revealed regarding the number of distinct holobiont haplotypes in native and invasive populations of the pest ...
Matteo Dho +6 more
wiley +1 more source
One-Three Join: A Graph Operation and Its Consequences
Discussiones Mathematicae Graph Theory, 2017 In this paper, we introduce a graph operation, namely one-three join. We show that the graph G admits a one-three join if and only if either G is one of the basic graphs (bipartite, complement of bipartite, split graph) or G admits a constrained ...
Shalu M.A., Devi Yamini S.
doaj +1 more source
Inverse of $α$-Hermitian Adjacency Matrix of a Unicyclic Bipartite Graph [PDF]
, 2022 Mohammad Abudayah +2 more
openalex +1 more source