Results 41 to 50 of about 6,109 (206)
Journal of Combinatorial Theory, Series B, 2012 27 pages, small revisions from previous version, this version appears in Journal of Combinatorial Theory Series ...
Engbers, John, Galvin, David
openaire +3 more sources
Star Bicolouring of Bipartite Graphs
AlgorithmsWe give an integer linear program formulation for the star bicolouring of bipartite graphs. We develop a column generation method to solve the linear programming relaxation to obtain a lower bound for the minimum number of colours needed.
Daya Gaur +2 more
doaj +1 more source
Extremal Graphs for Sombor Index with Given Parameters
Axioms, 2023 In this paper, we present the upper and lower bounds on Sombor index SO(G) among all connected graphs (respectively, connected bipartite graphs). We give some sharp lower and upper bounds on SO(G) among connected graphs in terms of some parameters ...
Wanping Zhang, Jixiang Meng, Na Wang
doaj +1 more source
The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph [PDF]
Parallel Processing Letters, 2020 In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the order of the graph. Since then, any bound on the sum and/or the product of an invariant in a graph [Formula: see text] and the same invariant in the complement [Formula: see text] of [Formula: see ...
Yingzhi Tian, Huaping Ma, Liyun Wu
openaire +3 more sources
Bounds On Fuzzy Dominator Chromatic Number of Fuzzy Soft Bipartite Graphs
Ratio Mathematica, 2023 An FSG GS(T,V) fuzzy’s soft dominator colouring (FSDC) is a suitable Fuzzy Soft Colouring (FSC) where every node of a colour group is dominated by a vertex of GS(T,V).
Jahir Hussain R, Afya Farhana M
doaj +1 more source
Bipartite Unique Neighbour Expanders via Ramanujan Graphs
EntropyWe construct an infinite family of bounded-degree bipartite unique neighbour expander graphs with arbitrarily unbalanced sides. Although weaker than the lossless expanders constructed by Capalbo et al., our construction is simpler and may be closer to ...
Ron Asherov, Irit Dinur
doaj +1 more source
Phase‐Sensitive Engineering of Optical Disordered Materials Using Heterogeneous Networks
Advanced Optical Materials, EarlyView.Networks provide an insightful framework for describing complex interactions. Here, we develop heterogeneous network modeling of light scattering to engineer multiphase random heterogeneous materials. We devise multipartite network decomposition, separating intra‐ and inter‐phase wave interferences.
Seungmok Youn +5 more
wiley +1 more source
The Median Problem on k-Partite Graphs
Discussiones Mathematicae Graph Theory, 2015 In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of the other vertices in G. The subgraph induced by the vertices of minimum (maximum) status in G is called the median (anti-median) of G.
Pravas Karuvachery, Vijayakumar Ambat
doaj +1 more source
Electronic Notes in Discrete Mathematics, 1999 Two graphs \(G\) and \(H\) on the vertex set \(V\) are \(P_4\)-isomorphic if there is a permutation \(\pi\) on \(V\) such that, for all subsets \(S\) of \(V\), \(S\) induces a chordless \(P_4\) in \(G\) if and only if \(\pi (S)\) induces a \(P_4\) in \(H\). The author characterizes all graphs \(P_4\)-isomorphic to a bipartite graph. For example, we can
openaire +1 more source
PAIR: Reconstructing Single‐Cell Open‐Chromatin Landscapes for Transcription Factor Regulome Mapping
Advanced Science, EarlyView.scATAC‐seq analysis is often constrained by limited sequencing depth, extreme sparsity, and pervasive technical missingness. PAIR is a probabilistic framework that restores scATAC‐seq accessibility profiles by directly modeling the native cell–peak bipartite structure of chromatin accessibility.
Yanchi Su +7 more
wiley +1 more source