Results 81 to 90 of about 96,628 (243)

Generation of Gray Codes Through the Rough Identity–Summand Graph of Filters of A Rough bi–Heyting Algebra

open access: yesInternational Journal of Applied Mathematics and Computer Science
This paper introduces the concept of filters in a rough bi-Heyting algebra. The rough bi-Heyting algebra defined through the rough semiring offers interesting properties.
Praba Bashyam   +1 more
doaj   +1 more source

Using random walks to generate associations between objects.

open access: yesPLoS ONE, 2014
Measuring similarities between objects based on their attributes has been an important problem in many disciplines. Object-attribute associations can be depicted as links on a bipartite graph.
Muhammed A Yildirim, Michele Coscia
doaj   +1 more source

Groups having complete bipartite divisor graphs for their conjugacy class sizes [PDF]

open access: yes, 2013
Given a finite group G, the bipartite divisor graph for its conjugacy class sizes is the bipartite graph with bipartition consisting of the set of conjugacy class sizes of G-Z (where Z denotes the centre of G) and the set of prime numbers that divide ...
Hafezieh, Roghayeh, Spiga, Pablo
core  

Decycling bipartite graphs

open access: yesJournal of Graph Algorithms and Applications, 2021
Let $G=(V,E)$ be a graph and let $S\subseteq V$ be a subset of its vertices. If the subgraph of $G$ induced by $V\setminus S$ is acyclic, then $S$ is said to be a decycling set of $G$. The size of a smallest decycling set of $G$ is called the decycling number of $G$. Determining the decycling number of a graph $G$ is NP-hard, even if $G$ is bipartite.
openaire   +2 more sources

Ichnological discrimination of hemipelagic‐dominated slope versus basin‐floor mudstones: Insights from early Viséan successions of a distally steepened ramp, northern Iran

open access: yesThe Depositional Record, EarlyView.
This study integrates sedimentological and ichnological data to reveal the depositional processes and environmental conditions of deep‐water muddy gravity flows in the Mobarak Formation. It highlights distinct ichnocoenoses and bioturbation patterns, offering insights into basin‐floor versus slope mudstones and their implications for hydrocarbon ...
Aram Bayet‐Goll   +2 more
wiley   +1 more source

The scaling of seed‐dispersal specialization in interaction networks across levels of organization

open access: yesEcography, EarlyView.
Natural ecosystems are characterized by a specialization pattern where few species are common while many others are rare. In ecological networks involving biotic interactions, specialization operates as a continuum at individual, species, and community levels. Theory predicts that ecological and evolutionary factors can primarily explain specialization.
Gabriel M. Moulatlet   +3 more
wiley   +1 more source

Bipartite graphs of small readability [PDF]

open access: yesTheoretical Computer Science, 2018
We study a parameter of bipartite graphs called readability, introduced by Chikhi et al. (Discrete Applied Mathematics, 2016) and motivated by applications of overlap graphs in bioinformatics. The behavior of the parameter is poorly understood. The complexity of computing it is open and it is not known whether the decision version of the problem is in ...
Chikhi, Rayan   +6 more
openaire   +7 more sources

Steiner Triple Systems With High Discrepancy

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 $r\ge 3$ and n ≡ 1 , 3 ( mod 6 ) $n\equiv 1,3\,(\mathrm{mod}\,6)$, any r $r$‐colouring of the triples on [ n ] $[n]$ admits a Steiner triple system of order n $n$ with discrepancy Ω ( n 2 ) ${\rm{\Omega }}({
Lior Gishboliner   +2 more
wiley   +1 more source

Completing Multi‐Latin Rectangles via Factors With Prescribed Degrees in Bipartite Graphs

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT Let Q $Q$ be an n×n $n\times n$ array whose top left r×s $r\times s$ sub‐array L $L$ is filled with a set of k $k$ different symbols such that each cell of L $L$ contains λ $\lambda $ symbols. In this note, we find conditions under which each empty cell of Q $Q$ can be filled with λ $\lambda $ symbols in such a way that the total number of ...
Amin Bahmanian
wiley   +1 more source

Home - About - Disclaimer - Privacy