Results 61 to 70 of about 10,299 (219)
Discrete Mathematics, 1997 Consider two bipartite graphs \(G=\{L,R,E\}\) and \(G'=\{L',R',E'\}\). A bijection \(f:L\cup R\to L'\cup R'\) such that \(f(L)=L'\) and \(f(u)f(v)\not\in E'\) for every edge \(uv\in E\) is called a bi-placement of \(G\) and \(G'\). The graphs \(G\) and \(G'\) are called bi-placeable if there exists a bi-placement of \(G\) and \(G'\).
A. Pawel Wojda, Paul Vaderlind
openaire +1 more source
Robust Representation Learning for Clean Feature Discovery in Incomplete Multi‐View Clustering
Advanced Intelligent Systems, EarlyView.Robust feature discovery in incomplete multi‐view clustering is achieved by coupling RPCA‐based clean representation recovery with neural‐network‐assisted graph learning. The resulting RIMVC framework constructs cleaner and more discriminative graph‐structured representations from incomplete and noisy multi‐view data, improving clustering robustness ...
Ping Hu +4 more
wiley +1 more source
Decomposition of Certain Complete Bipartite Graphs into Prisms
Discussiones Mathematicae Graph Theory, 2017 Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2016 Abstract A set S ⊆ V ( G ) is stable (or independent) if no two vertices from S are adjacent. Let Ψ ( G ) be the family of all local maximum stable sets [V. E. Levit, E. Mandrescu, A new greedoid: the family of local maximum stable sets of a forest, Discr. Appl. Math.
Vadim E. Levit, Eugen Mandrescu
openaire +1 more source
RNA‐centric world of retroviruses: unravelling the molecular strategies of genomic RNA packaging
Biological Reviews, EarlyView.ABSTRACT Retroviruses constitute a unique group of RNA viruses that have profoundly influenced both evolutionary trajectories and biomedical research. Their ability to reverse transcribe and integrate into host genomes has shaped genomic architecture across species and contributed to our understanding of oncogenes, gene regulation, and RNA biology ...
Mohammad Abdullah Jehad +5 more
wiley +1 more source
BIPARTITE STEINHAUS GRAPHS [PDF]
Taiwanese Journal of Mathematics, 1999 A Steinhaus matrix is a symmetric 0-1 matrix \([a_{i,j}]_{n\times n}\) such that \(a_{i,j}= 0\) for \(0\leq i\leq n-1\) and \(a_{i,j}\equiv (a_{i- 1,j-1}+ a_{i-1,j})\pmod 2\) for \(1\leq i\leq n-1\). A Steinhaus graph is a graph whose adjacency matrix is a Steinhaus matrix. In this paper Lee and Chang prove that if \(G\) is a Steinhaus graph of order \(
Lee, Yueh-Shin, Chang, G. J.
openaire +3 more sources
Business Strategy and the Environment, EarlyView.ABSTRACT This study systematizes the literature on eco‐innovation and economic complexity, aiming to understand how the sophistication of productive structures shapes countries' capacity to develop environmentally responsible innovations, and how eco‐innovation may, in turn, influence productive sophistication.
Gregory Matheus Pereira de Moraes +1 more
wiley +1 more source
A note on pm-compact bipartite graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2
Liu Jinfeng, Wang Xiumei
doaj +1 more source
Discrete Mathematics, 1993 This paper deals with bithreshold graphs and their characterization. After having given some necessary properties the authors succeed in proving a complete characterization of the class of bipartite bithreshold graphs by means of 11 not bithreshold (so-called forbidden induced subgraphs) and 5 classes of induced subgraphs.
Peter L. Hammer +2 more
openaire +1 more source
Conditional Randomization Tests for the Specification of Interference Structure
Journal of Applied Econometrics, EarlyView.ABSTRACT This study proposes specification tests for interference structure in causal inference with spillovers. We focus on experimental settings in which the treatment assignment mechanism is known. To test whether a given exposure mapping adequately summarizes the true interference structure, we develop conditional randomization tests by utilizing ...
Tadao Hoshino, Takahide Yanagi
wiley +1 more source