Results 81 to 90 of about 92,446 (202)

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, Evelyne Flandrin, Grzegorz Gancarzewicz   +2 more
doaj   +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, Julia Brennecke, Christiana Weber   +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, Chuang Liu, Yang Chen, Zi‐Ke Zhang, Xiaoyang Liu, Xiu‐Xiu Zhan   +5 more
wiley   +1 more source

Generating Compressed Counterfactual Hard Negative Samples for Graph Contrastive Learning

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Graph contrastive learning (GCL) relies on acquiring high‐quality positive and negative samples to learn the structural semantics of the input graph. Previous approaches typically sampled negative samples from the same training batch or an irrelevant external graph.
Haoran Yang, Hongxu Chen, Xiangyu Zhao, Sixiao Zhang, Xiangguo Sun, Qian Li, Hongzhi Yin, Guandong Xu   +7 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

Multilocus sequence typing of the invasive pest Halyomorpha halys (Hemiptera: Pentatomidae) and associated endosymbiont reveals unexplored diversity

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, Matteo Montagna, Chenxi Liu, Giulia Magoga, Giobbe Forni, Alberto Alma, Elena Gonella   +6 more
wiley   +1 more source

Making Bipartite Graphs DM-Irreducible

SIAM Journal on Discrete Mathematics, 2018
The Dulmage--Mendelsohn decomposition (or the DM-decomposition) gives a unique partition of the vertex set of a bipartite graph reflecting the structure of all the maximum matchings therein. A bipartite graph is said to be DM-irreducible if its DM-decomposition consists of a single component.
Bérczi, Kristóf, Iwata, Satoru, Kato, Jun, Yamaguchi, Yutaro   +3 more
openaire   +2 more sources

Modular and scalable system for 3D behavioural assays of olfactory and gustatory preferences in flying insects

Methods in Ecology and Evolution, EarlyView.
Abstract Plant–pollinator interactions are fundamental to the functioning of natural ecosystems and the enhancement of agricultural productivity. An effective support of pollinator communities necessitates a comprehensive understanding of the mechanisms underlying pollinator attraction and nutritional preferences.
Pierre Ouvrard, Sebastian Thiele, Benjamin Risse, Adrien Sicard   +3 more
wiley   +1 more source

Identifiability conditions in cognitive diagnosis: Implications for Q‐matrix estimation algorithms

British Journal of Mathematical and Statistical Psychology, EarlyView.
Abstract The Q‐matrix of a cognitively diagnostic assessment (CDA), documenting the item‐attribute associations, is a key component of any CDA. However, the true Q‐matrix underlying a CDA is never known and must be estimated—typically by content experts.
Hyunjoo Kim, Hans Friedrich Köhn, Chia‐Yi Chiu   +2 more
wiley   +1 more source