Results 81 to 90 of about 1,202 (110)
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
Quasirandom Graphs and the Pantograph Equation. [PDF]
Am Math Mon, 2021 Shapira A, Tyomkyn M.
europepmc +1 more source
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
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
Rainbow Vertex-Connection and Forbidden Subgraphs
Discussiones Mathematicae Graph Theory, 2018 A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them ...
Li Wenjing, Li Xueliang, Zhang Jingshu
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
On the δ-chromatic numbers of the Cartesian products of graphs
Open MathematicsIn this work, we study the δ\delta -chromatic number of a graph, which is the chromatic number of the δ\delta -complement of a graph. We give a structure of the δ\delta -complements and sharp bounds on the δ\delta -chromatic numbers of the Cartesian ...
Tangjai Wipawee +2 more
doaj +1 more source
Extremal values on Zagreb indices of trees with given distance k-domination number. [PDF]
J Inequal Appl, 2018 Pei L, Pan X.
europepmc +1 more source
New upper bounds on the order of cages
Electronic Journal of Combinatorics, 1996 F. Lazebnik, V. Ustimenko, A. Woldar
semanticscholar +1 more source