Results 61 to 70 of about 1,105 (90)
Forbidden Pairs and (k,m)-Pancyclicity
Discussiones Mathematicae Graph Theory, 2017 A graph G on n vertices is said to be (k, m)-pancyclic if every set of k vertices in G is contained in a cycle of length r for each r ∈ {m, m+1, . . . , n}.
Crane Charles Brian
doaj +1 more source
Removable Edges on a Hamilton Cycle or Outside a Cycle in a 4-Connected Graph
Discussiones Mathematicae Graph Theory, 2021 Let G be a 4-connected graph. We call an edge e of G removable if the following sequence of operations results in a 4-connected graph: delete e from G; if there are vertices with degree 3 in G− e, then for each (of the at most two) such vertex x, delete ...
Wu Jichang +3 more
doaj +1 more source
Outpaths of Arcs in Regular 3-Partite Tournaments
Discussiones Mathematicae Graph Theory, 2021 Guo [Outpaths in semicomplete multipartite digraphs, Discrete Appl. Math. 95 (1999) 273–277] proposed the concept of the outpath in digraphs. An outpath of a vertex x (an arc xy, respectively) in a digraph is a directed path starting at x (an arc xy ...
Guo Qiaoping, Meng Wei
doaj +1 more source
Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs
Discussiones Mathematicae Graph Theory, 2022 A graph G is called Hamilton-connected if for every pair of distinct vertices {u, v} of G there exists a Hamilton path in G that connects u and v. A graph G is said to be t-tough if t·ω(G − X) ≤ |X| for all X ⊆ V (G) with ω(G − X) > 1. The toughness of G,
Zheng Wei, Broersma Hajo, Wang Ligong
doaj +1 more source
Heavy Subgraphs, Stability and Hamiltonicity
Discussiones Mathematicae Graph Theory, 2017 Let G be a graph. Adopting the terminology of Broersma et al. and Čada, respectively, we say that G is 2-heavy if every induced claw (K1,3) of G contains two end-vertices each one has degree at least |V (G)|/2; and G is o-heavy if every induced claw of G
Li Binlong, Ning Bo
doaj +1 more source
Some Results on the Independence Polynomial of Unicyclic Graphs
Discussiones Mathematicae Graph Theory, 2018 Let G be a simple graph on n vertices. An independent set in a graph is a set of pairwise non-adjacent vertices. The independence polynomial of G is the polynomial I(G,x)=∑k=0ns(G,k)xk$I(G,x) = \sum\nolimits_{k = 0}^n {s\left({G,k} \right)x^k }$, where s(
Oboudi Mohammad Reza
doaj +1 more source
The Crossing Number of Join of the Generalized Petersen Graph P(3, 1) with Path and Cycle
Discussiones Mathematicae Graph Theory, 2018 There are only few results concerning the crossing numbers of join of some graphs. In this paper, the crossing numbers of join products for the generalized Petersen graph P(3, 1) with n isolated vertices as well as with the path Pn on n vertices and with
Ouyang Zhang Dong +2 more
doaj +1 more source
Depth and Stanley depth of the edge ideals of the powers of paths and cycles
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 Let k be a positive integer. We compute depth and Stanley depth of the quotient ring of the edge ideal associated to the kth power of a path on n vertices.
Iqbal Zahid, Ishaq Muhammad
doaj +1 more source
Lower bound for the size of maximal nontraceable graphs
, 2004 Let g(n) denote the minimum number of edges of a maximal nontraceable graph of order n. Dudek, Katona and Wojda (2003) showed that g(n)\geq\ceil{(3n-2)/2}-2 for n\geq 20 and g(n)\leq\ceil{(3n-2)/2} for n\geq 54 as well as for n\in I={22,23,30,31,38,39 ...
Frick, Marietjie, Singleton, Joy
core +2 more sources
Hamilton cycles in almost distance-hereditary graphs
Open Mathematics, 2016 Let G be a graph on n ≥ 3 vertices. A graph G is almost distance-hereditary if each connected induced subgraph H of G has the property dH(x, y) ≤ dG(x, y) + 1 for any pair of vertices x, y ∈ V(H).
Chen Bing, Ning Bo
doaj +1 more source