Results 101 to 110 of about 1,017,247 (314)
Placement Delivery Array Design Through Strong Edge Coloring of Bipartite Graphs [PDF]
IEEE Communications Letters, 2016 The technique of coded caching proposed by Madddah-Ali and Niesen is a promising approach to alleviate the load of networks during peak-traffic times. Recently, placement delivery array (PDA) was presented to characterize both the placement and delivery ...
Qifa Yan +3 more
semanticscholar +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
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets.
Czap Július +2 more
doaj +1 more source
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
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs [PDF]
, 2003 Robert E. Jamison characterized chordal graphs by the edge set of every k-cycle being the symmetric difference of k−2 triangles. Strongly chordal (and chordal bipartite) graphs can be similarly characterized in terms of the distribution of triangles ...
McKee, Terry A.
core +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
Journal of Inequalities and Applications, 2017 In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with maximum degree Δ and among all non-bipartite connected graphs of order n with maximum ...
Shu-Guang Guo, Rong Zhang
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
Regularity of powers of bipartite graphs [PDF]
Journal of Algebraic Combinatorics, 2016 Let G be a finite simple graph and I(G) denote the corresponding edge ideal. For all s≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs ...
A. V. Jayanthan +2 more
semanticscholar +1 more source
Distance Biregular Bipartite Graphs [PDF]
, 1994 We describe here some properties of a class of graphs which extends the class of distance regular graphs: our graphs are bipartite and for each vertex there exists an intersection array depending on the stable component of the vertex. Thus our graphs are
Delorme, C.
core +1 more source