Results 121 to 130 of about 6,109 (206)

Biclique: an R package for maximal biclique enumeration in bipartite graphs. [PDF]

BMC Res Notes, 2020
Lu Y, Phillips CA, Langston MA.
europepmc   +1 more source

Zarankiewicz bounds from distal regularity lemma

Bulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.
Abstract Since Kővári, Sós and Turán proved upper bounds for the Zarankiewicz problem in 1954, much work has been undertaken to improve these bounds, and some have done so by restricting to particular classes of graphs. In 2017, Fox, Pach, Sheffer, Suk and Zahl proved better bounds for semialgebraic binary relations, and this work was extended by Do in
Mervyn Tong
wiley   +1 more source

Groups with conjugacy classes of coprime sizes

Bulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.
Abstract Suppose that x$x$, y$y$ are elements of a finite group G$G$ lying in conjugacy classes of coprime sizes. We prove that ⟨xG⟩∩⟨yG⟩$\langle x^G \rangle \cap \langle y^G \rangle$ is an abelian normal subgroup of G$G$ and, as a consequence, that if x$x$ and y$y$ are π$\pi$‐regular elements for some set of primes π$\pi$, then xGyG$x^G y^G$ is a π ...
R. D. Camina, A. Maróti, E. Pacifici, C. Parker, K. Rekvényi, J. Saunders, V. Sotomayor, G. Tracey, M. van Beek   +8 more
wiley   +1 more source

Diophantine tuples and product sets in shifted powers

Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.
Abstract Let k⩾2$k\geqslant 2$ and n≠0$n\ne 0$. A Diophantine tuple with property Dk(n)$D_k(n)$ is a set of positive integers A$A$ such that ab+n$ab+n$ is a k$k$th power for all a,b∈A$a,b\in A$ with a≠b$a\ne b$. Such generalizations of classical Diophantine tuples have been studied extensively.
Ernie Croot, Chi Hoi Yip
wiley   +1 more source

Computing the permanental polynomial of 4k-intercyclic bipartite graphs

The American Journal of Combinatorics
Let \(G\) be a bipartite graph with adjacency matrix \(A(G)\). The characteristic polynomial \(\phi(G,x)=\det(xI-A(G))\) and the permanental polynomial \(\pi(G,x) = \operatorname{per}(xI-A(G))\) are both graph invariants used to distinguish graphs.
Ravindra Bapat, Ranveer Singh, Hitesh Wankhede   +2 more
doaj   +1 more source

Effects on Seidel energy of two special types of graphs by perturbing edges

Kuwait Journal of Science
Let G be a simple undirected graph, and let S(G) be its Seidel matrix. The Seidel energy of G is defined as ES(G)=∑i=1n|λS(G)|, where λS(G),λS(G),…,λS(G) are Seidel eigenvalues of G.
doaj   +1 more source

Bipartite graphs in systems biology and medicine: a survey of methods and applications. [PDF]

Gigascience, 2018
Pavlopoulos GA, Kontou PI, Pavlopoulou A, Bouyioukos C, Markou E, Bagos PG.   +5 more
europepmc   +1 more source

NET-EXPO: A Gephi Plugin Towards Social Network Analysis of Network Exposure for Unipartite and Bipartite Graphs. [PDF]

HCI Int 2019 Posters (2019), 2019
Amith MT, Fujimoto K, Tao C.
europepmc   +1 more source

Bipartite Graphs for Visualization Analysis of Microbiome Data. [PDF]

Evol Bioinform Online, 2016
Sedlar K, Videnska P, Skutkova H, Rychlik I, Provaznik I.   +4 more
europepmc   +1 more source

Unmixed bipartite graphs

, 2006
In this note we give a combinatorial characterization of all the unmixed bipartite graphs.
openaire   +4 more sources