Zobrazeno 1 - 10
of 948
pro vyhledávání: '"Graph toughness"'
Publikováno v:
Proceedings of the American Mathematical Society, 2017 Feb 01. 145(2), 487-499.
Externí odkaz:
https://www.jstor.org/stable/procamermathsoci.145.2.487
Publikováno v:
Theoretical Computer Science. 774:44-50
A path in an edge-colored graph is called a proper path if no two adjacent edges of the path receive the same color. For a connected graph G, the proper connection number p c ( G ) of G is defined as the minimum number of colors needed to color its e
Autor:
Chih-wen Weng, Louis Kao
The relation between Hamiltonicity and toughness of a graph is a long standing research problem. The paper studies the Hamiltonicity of the Cartesian product graph $$G_1\square G_2$$ of graphs $$G_1$$ and $$G_2$$ satisfying that $$G_1$$ is traceable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1543c43ab00b877a5636c3d8f4c27b38
http://arxiv.org/abs/2003.03084
http://arxiv.org/abs/2003.03084
Autor:
Raul Lopes, Victor Campos
Publikováno v:
Discrete Applied Mathematics. 245:202-207
The Turan number ex ( n , H ) is the maximum number of edges in a graph on n vertices which does not contain H as a subgraph. Gorgol gives a lower bound for ex ( n , H ) when H is the disjoint union of k copies of P 3 and conjectures this bound is ti
Publikováno v:
Theoretical Computer Science. 734:72-82
A split graph is a graph whose vertices can be partitioned into a clique and an independent set. We study numerous problems on split graphs, namely the k -Vertex-Disjoint Paths , k -Cycle , k -Path and k - l -Stable Set problems. In the k -Vertex-Dis
Publikováno v:
Discrete Mathematics. 341:1160-1165
Let k be a positive integer. In this paper, we prove that for a graph G with at least 4 k vertices, if max { d ( x ) , d ( y ) } ≥ 2 k for any pair of nonadjacent vertices { x , y } ⊆ V ( G ) , then G contains k disjoint cycles. This generalizes
Autor:
Jeong-Hyun Kang
Publikováno v:
Discrete Mathematics. 341:96-103
The vertices of Kneser graph K ( n , k ) are the subsets of { 1 , 2 , … , n } of cardinality k , two vertices are adjacent if and only if they are disjoint. The square G 2 of a graph G is defined on the vertex set of G with two vertices adjacent if
Publikováno v:
Discrete Mathematics. 341:33-41
We study the problem of determining the graph with n vertices having largest signless Laplacian energy. We conjecture it is the complete split graph whose independent set has (roughly) 2 n ∕ 3 vertices. We show that the conjecture is true for sever
Publikováno v:
Discrete Mathematics. 340:3020-3031
The decycling number ∇ ( G ) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycle. A decycling set containing exactly ∇ ( G ) vertices of G is called a ∇ -set. For any decycli
Autor:
Gui-Xian Tian
Publikováno v:
Discrete Applied Mathematics. 233:224-230
Let G be a simple connected graph. Denote the Kirchhoff index and the degree-Kirchhoff index of G by K f ( G ) and K f ∗ ( G ) , respectively. This paper considers the asymptotic behavior of K f ( T k ( G ) ) and K f ∗ ( T k ( G ) ) of the iterat