Wang et al., 2019 - Google Patents
Spanning trees with at most 4 leaves in K1, 5-free graphsWang et al., 2019
View HTML- Document ID
- 8215259621039402407
- Author
- Wang P
- Cai J
- Publication year
- Publication venue
- Discrete Mathematics
External Links
Snippet
A graph G is a K 1, r-free graph if it contains no induced subgraph isomorphic to K 1, r. In this paper, we prove that for a connected K 1, 5-free graph G, if σ 5 (G)≥| G|− 1, then G contains a spanning tree with at most 4 leaves. Moreover, we give an example to show the sharpness …
- 235000014510 cooky 0 description 2
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhou | On g-extra connectivity of hypercube-like networks | |
| Bonder et al. | Fractional order orlicz-sobolev spaces | |
| Sabir et al. | Structure fault tolerance of hypercubes and folded hypercubes | |
| Kwon et al. | On Jacobian group and complexity of the generalized Petersen graph GP (n, k) through Chebyshev polynomials | |
| Sun et al. | Critical groups at zero and multiple solutions for a quasilinear elliptic equation | |
| Gastineau et al. | On the packing chromatic number of subcubic outerplanar graphs | |
| Bonnet et al. | The graph motif problem parameterized by the structure of the input graph | |
| Haas et al. | Reconfiguring dominating sets in some well-covered and other classes of graphs | |
| Coskun et al. | Ulrich Schur bundles on flag varieties | |
| Cui et al. | Stationary solutions to the one-dimensional micropolar fluid model in a half line: existence, stability and convergence rate | |
| Chang et al. | On conflict-free connection of graphs | |
| Daoud | Complexity of graphs generated by wheel graph and their asymptotic limits | |
| Shan et al. | Space–time Legendre–Gauss–Lobatto collocation method for two-dimensional generalized sine-Gordon equation | |
| Dabkowski et al. | Multiple periodic solutions for Γ-symmetric Newtonian systems | |
| Andrade et al. | New bounds for the signless Laplacian spread | |
| Liu et al. | Spanning tree packing number and eigenvalues of graphs with given girth | |
| Wang et al. | Spanning trees with at most 4 leaves in K1, 5-free graphs | |
| Liu et al. | It’s all in the hidden states: A longevity hedging strategy with an explicit measure of population basis risk | |
| Abrishami et al. | Independent domination in subcubic graphs of girth at least six | |
| García et al. | On fuzzy uniformities induced by a fuzzy metric space | |
| Yang et al. | On the cardinality of general h-fold sumsets | |
| Chudnovsky et al. | Excluding the fork and antifork | |
| Abel et al. | Existence of 4-GDDs with at most 50 points and 4-GDDs of types 6s3t and 9s3t | |
| Sánchez-Perales et al. | Spectral continuity using ν-convergence | |
| Bickel et al. | Characterizations of A2 matrix power weights |