Results 1 to 10 of about 1,711,171 (86)
Solutions to problems about potentially Ks,t-bigraphic pair [PDF]
Open Mathematics, 2022 Let S=(a1,…,am;b1,…,bn)S=\left({a}_{1},\ldots ,{a}_{m};\hspace{0.33em}{b}_{1},\ldots ,{b}_{n}), where a1,…,am{a}_{1},\ldots ,{a}_{m} and b1,…,bn{b}_{1},\ldots ,{b}_{n} are two nonincreasing sequences of nonnegative integers. The pair S=(a1,…,am;b1,…,bn)S=
Yin Jian-Hua, Zhang Liang
doaj +6 more sources
Discussiones Mathematicae Graph Theory, 2020 Let S = (a1,. . . , am; b1, . . . , bn), where a1, . . . , am and b1, . . . , bn are two sequences of nonnegative integers. We say that S is a bigraphic pair if there exists a simple bipartite graph G with partite sets {x1, x2, . . . , xm} and {y1, y2, .
Yin Jian-Hua, Li Sha-Sha
doaj +7 more sources
About an extremal problem of bigraphic pairs with a realization containing Ks,t
Discussiones Mathematicae Graph Theory, 2020 Let $\pi=(f_1, \ldots ,f_m;g_1, \ldots ,g_n)$, where $f_1, \ldots ,f_m$ and $g_1, \ldots ,g_n$ are two non-increasing sequences of nonnegative integers. The pair $\pi=(f_1,\ldots,f_m;$ $g_1,\ldots,g_n)$ is said to be a bigraphic pair if there is a simple
Bing Wang, Jian-Hua Yin
core +6 more sources
A Constructive Extension of the Characterization on Potentially Ks,t-Bigraphic Pairs
Discussiones Mathematicae Graph Theory, 2017 Let Ks,t be the complete bipartite graph with partite sets of size s and t. Let L1 = ([a1, b1], . . . , [am, bm]) and L2 = ([c1, d1], . . . , [cn, dn]) be two sequences of intervals consisting of nonnegative integers with a1 ≥ a2 ≥ . . . ≥ am and c1 ≥ c2
Guo Ji-Yun, Yin Jian-Hua
doaj +5 more sources
Bigraphic pairs with a realization containing a split bipartite-graph [PDF]
Czechoslovak Mathematical Journal, 2019 Let Ks,t be the complete bipartite graph with partite sets {x1, …, xs} and {y1, …, yt}. A split bipartite-graph on (s + s′) + (t + t′) vertices, denoted by SBs + s′, t + t′, is the graph obtained from Ks,t by adding s′ + t′ new vertices xs + 1, …, xs + s′}, yt + 1, …, yt + t′ such that each of xs + 1, …, xs + s′; is adjacent to each of y1, …, yt and ...
Hai-Yan Li +3 more
semanticscholar +5 more sources
A Gale–Ryser type characterization of potentially
Discrete Mathematics, 2012 AbstractLet A and B be nonincreasing lists of nonnegative integers, having lengths m and n, respectively. The pair (A;B) is potentially Ks,t-bigraphic if there is a simple bipartite graph containing Ks,t (with s vertices in the part of size m and t in the part of size n) such that the lists of vertex degrees in the two partite sets are A and B. We give
Jian-Hua Yin, Xiao-Fei Huang
core +5 more sources
An extremal problem on bigraphic pairs with an
Discrete Mathematics, 2016 Let S = ( a 1 , ? , a m ; b 1 , ? , b n ) , where a 1 , ? , a m and b 1 , ? , b n are two nonincreasing sequences of nonnegative integers. The pair S = ( a 1 , ? , a m ; b 1 , ? , b n ) is said to be a bigraphic pair if there is a simple bipartite graph G = ( X ? Y , E ) such that a 1 , ? , a m and b 1 , ? , b n are the degrees of the vertices in X and
Jian-Hua Yin
openaire +3 more sources
An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences [PDF]
, 2021 As a partial answer to a question of Rao, a deterministic and customizable efficient algorithm is presented to test whether an arbitrary graphical degree sequence has a bipartite realization.
Wang, Kai
core +2 more sources
Advanced Techniques for the Decipherment of Ancient Scripts [PDF]
, 2022 This contribution explores modern and traditional approaches to the decipherment of ancient writing systems. It surveys methods used by paleographers and epigraphers and state-of-the art applications of computational linguistics, such as models based on ...
Ferrara S., Tamburini F.
core +1 more source
On the bipartite graph packing problem [PDF]
, 2017 The graph packing problem is a well-known area in graph theory. We consider a bipartite version and give almost tight conditions on the packability of two bipartite ...
Vásárhelyi, Bálint
core +2 more sources