Results 61 to 70 of about 238 (93)
An extremal problem on potentially K p,1,1-graphic sequences
Discrete Mathematics & Theoretical Computer Science, 2005 A sequence S is potentially K p,1,1 graphical if it has a realization containing a K p,1,1 as a subgraph, where K p,1,1 is a complete 3-partite graph with partition sizes p,1,1.
Chunhui Lai
doaj
Another View of Bipartite Ramsey Numbers
Discussiones Mathematicae Graph Theory, 2018 For bipartite graphs F and H and a positive integer s, the s-bipartite Ramsey number BRs(F,H) of F and H is the smallest integer t with t ≥ s such that every red-blue coloring of Ks,t results in a red F or a blue H.
Bi Zhenming, Chartrand Gary, Zhang Ping
doaj +1 more source
Turán Function and H-Decomposition Problem for Gem Graphs
Discussiones Mathematicae Graph Theory, 2018 Given a graph H, the Turán function ex(n,H) is the maximum number of edges in a graph on n vertices not containing H as a subgraph. For two graphs G and H, an H-decomposition of G is a partition of the edge set of G such that each part is either a single
Liu Henry, Sousa Teresa
doaj +1 more source
On the Maximum and Minimum Sizes of a Graph with Given k-Connectivity
Discussiones Mathematicae Graph Theory, 2017 The concept of k-connectivity κk(G), introduced by Chartrand in 1984, is a generalization of the cut-version of the classical connectivity. For an integer k ≥ 2, the k-connectivity of a connected graph G with order n ≥ k is the smallest number of ...
Sun Yuefang
doaj +1 more source
On Nordhaus-Gaddum type relations of δ-complement graphs. [PDF]
Heliyon, 2023 Vichitkunakorn P +2 more
europepmc +1 more source
An efficient asymmetric removal lemma and its limitations
Forum of Mathematics, SigmaThe triangle removal states that if G contains $\varepsilon n^2$ edge-disjoint triangles, then G contains $\delta (\varepsilon )n^3$ triangles. Unfortunately, there are no sensible bounds on the order of growth of $\delta (\varepsilon )$
Lior Gishboliner +2 more
doaj +1 more source
Quasirandom Graphs and the Pantograph Equation. [PDF]
Am Math Mon, 2021 Shapira A, Tyomkyn M.
europepmc +1 more source
The optimal pebbling of spindle graphs
Open Mathematics, 2019 Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The optimal pebbling number of G, denoted by πopt(G), is the smallest number
Gao Ze-Tu, Yin Jian-Hua
doaj +1 more source
A Parametric Network Approach for Concepts Hierarchy Generation in Text Corpus
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 The article presents a preflow approach for the parametric maximum flow problem, derived from the rules of constructing concepts hierarchy in text corpus.
Sângeorzan L. S. +2 more
doaj +1 more source
A Laplacian eigenbasis for threshold graphs
Special MatricesLet GG be a graph on nn vertices. In this article, we prove that an eigenbasis of the Laplacian matrix of a star graph of order nn is also an eigenbasis of GG if and only if GG is a threshold graph. As an application of this spectral characterization, we
Macharete Rafael R. +3 more
doaj +1 more source