Results 71 to 80 of about 10,299 (219)
International Journal of Applied Mathematics and Computer ScienceThis 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
Domination in bipartite graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jochen Harant, Dieter Rautenbach
openaire +2 more sources
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Journal of Robotics, 2020 The paper discusses the solution of the assignment task between two groups of mobile (MR) objects. The assignment task is to determine the purpose of MR to each other when playing football.
Denis Aleksandrovich Beloglazov +3 more
doaj +1 more source
On balanced bipartitions of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Bollobás and Scott conjectured that every graph G has a balanced bipartite spanning subgraph H such that for each for each In this paper, we consider the contrary side and show that every graphic sequence has a realization G which admits a balanced bipartite spanning subgraph H such that for each and we show that the bound is sharp.
openaire +2 more sources
Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A balanced ( p , q ) $(p,q)$‐coloring of a signed graph ( G , σ ) $(G,\sigma )$ is an assignment of q $q$ colors to each vertex of G $G$ from a platter of p $p$ colors, such that each color class induces a balanced set (a set that does not induce a negative cycle).
Reza Naserasr +3 more
wiley +1 more source
Multi-View Clustering via Projection-Enhanced Bipartite Graph Learning and Consensus Fusion
MathematicsAnchor-based bipartite graph methods provide scalable solutions for multi-view clustering, but most of them construct graphs in the original feature space, where high dimensionality distorts the proximity between samples and anchors and degrades graph ...
Xun Liu, Qing-Wen Wang, Jiang-Feng Chen
doaj +1 more source
Fractional List Packing for Layered Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source
On the deficiency of bipartite graphs
Discrete Applied Mathematics, 1999 An edge-coloring of a graph \(G\) with colors \(1,2,3,\dots\) is consecutive if the set of colors present at each vertex of \(G\) is a consecutive set of integers. For a bipartite graph \(G\), a consecutive edge-coloring has an application in scheduling and thus had been studied before by A. S. Asratian, R. R. Kamalian, D. Hanson, C. O. M.
Krzysztof Giaro +2 more
openaire +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, EarlyView.ABSTRACT Chvátal showed that for any tree T $T$ with k $k$ edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1 $R(T,n)=k(n-1)+1$. For r = 3 $r=3$ or 4, we show that, if T $T$ is an r $r$‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ) $R(T,n)={\rm{\Theta }}({n}^{r-1})$.
Jiaxi Nie
wiley +1 more source