Biblio Discovery — Demo Discovery Service

25 hasil untuk "Gary Chartrand"

Menampilkan 1–20 · 0,87 detik · RSS

  1. Artikel Jurnal Teks lengkap

    Autobiographical notes

    Gary Chartrand

    Discrete Mathematics Letters, Vol. 1 · 2019 · Inggris · DOAJ Scopus

  2. Artikel Jurnal Teks lengkap

    New directions in Ramsey theory

    Gary Chartrand; Ping Zhang

    Discrete Mathematics Letters, Vol. 6 · 2021 · Inggris · DOAJ Scopus

  3. Artikel Jurnal

    Ramsey sequences of graphs

    Gary Chartrand; Ping Zhang

    AKCE International Journal of Graphs and Combinatorics, Vol. 17 No. 2 · 2020 · Inggris · DOAJ Scopus

    A sequence of graphs is a Ramsey sequence if for every positive integer k, the graph Gk is isomorphic to a proper subgraph of and for each positive integer k, there is an integer such that every red-blue coloring of Gn results in a monochromatic Gk. Some sequences of graphs that are Ramsey…

  4. Artikel Jurnal Teks lengkap

    Strong Ramsey Numbers of Graphs

    Gary Chartrand; Ping Zhang

    Electronic Journal of Mathematics, Vol. 11 · 2026 · Inggris · DOAJ

  5. Artikel Jurnal Teks lengkap

    Locally Irregular-Connected Graphs

    Gary Chartrand; Ping Zhang

    Mathematics, Vol. 14 No. 11 · 2026 · Inggris · DOAJ Scopus

    A graph G is locally irregular if every two adjacent vertices have distinct degrees and is locally irregular-connected if for every two vertices u and v of G, there is a locally irregular u−v path in G. For a finite set S of two or more positive integers with maximum element k, it is known that…

  6. Artikel Jurnal Teks lengkap

    Strong Ramsey Numbers of Graphs of Size 4

    Gary Chartrand; Ping Zhang

    Mathematics, Vol. 14 No. 12 · 2026 · Inggris · DOAJ Scopus

    The Ramsey number R(G) of a graph G without isolated vertices is the minimum order n of the complete graph Kn for which every red-blue edge coloring results in a monochromatic subgraph isomorphic to G. The strong Ramsey number R¯(F,H) of two non-isomorphic graphs F and H without isolated vertices…

  7. Artikel Jurnal Teks lengkap

    Strong Ramsey Numbers of All Sets of Three Graphs of Size 3

    Gary Chartrand; Ping Zhang

    Axioms, Vol. 15 No. 8 · 2026 · Inggris · DOAJ Dikeluarkan Scopus 2023

    The strong Ramsey number R¯(F,H) of two graphs F and H without isolated vertices is the minimum positive integer n such that every red-blue (edge) coloring of Kn results in two edge-disjoint monochromatic subgraphs, one isomorphic to F and the other isomorphic to H. These numbers have been…

  8. Artikel Jurnal Teks lengkap

    Proper mean colorings of graphs

    Gary Chartrand; James Hallas; Ping Zhang

    Discrete Mathematics Letters, Vol. 3 · 2020 · Inggris · DOAJ Scopus

  9. Artikel Jurnal Teks lengkap

    Ramsey Chains in Linear Forests

    Gary Chartrand; Ritabrato Chatterjee; Ping Zhang

    Axioms, Vol. 12 No. 11 · 2023 · Inggris · DOAJ Dikeluarkan Scopus 2023

    Every red–blue coloring of the edges of a graph G results in a sequence G1, G2, …, Gℓ of pairwise edge-disjoint monochromatic subgraphs Gi (1≤i≤ℓ) of size i, such that Gi is isomorphic to a subgraph of Gi+1 for 1≤i≤ℓ−1. Such a sequence is called a Ramsey chain in G, and ARc(G) is the maximum length…

  10. Artikel Jurnal Teks lengkap

    Irregular domination in trees

    Peter Broe; Gary Chartrand; Ping Zhang

    Electronic Journal of Mathematics, Vol. 1 · 2021 · Inggris · DOAJ

  11. Artikel Jurnal

    On subset labelings of trees

    Gary Chartrand; Ebrahim Salehi; Ping Zhang

    AKCE International Journal of Graphs and Combinatorics, Vol. 21 No. 1 · 2024 · Inggris · DOAJ

    AbstractFor a nontrivial graph G, a subset labeling of G is a labeling of the vertices of G with nonempty subsets of the set [Formula: see text] for a positive integer r such that two vertices of G have disjoint labels if and only if the vertices are adjacent. The subset index [Formula: see text]…

  12. Artikel Jurnal Teks lengkap

    Monochromatic subgraphs in graphs

    Gary Chartrand; Emma Jent; Ping Zhang

    Contributions to Mathematics, Vol. 9 · 2024 · Inggris · DOAJ

  13. Artikel Jurnal

    The hull number of an oriented graph

    Gary Chartrand; John Frederick Fink; Ping Zhang

    International Journal of Mathematics and Mathematical Sciences, Vol. 2003 No. 36 · 2003 · Inggris · DOAJ Scopus

    We present characterizations of connected graphs G of order n≥2 for which h+(G)=n. It is shown that for every two integers n and m with 1≤n−1≤m≤(n2), there exists a connected graph G of order n and size m such that for each integer k with 2≤k≤n, there exists an orientation of G with hull number G.

  14. Artikel Jurnal

    Bridge and cycle degrees of vertices of graphs

    Gary Chartrand; Farrokh Saba; Nicholas C. Wormald

    International Journal of Mathematics and Mathematical Sciences, Vol. 7 No. 2 · 1984 · Inggris · DOAJ Scopus

    The bridge degree bdeg v and cycle degree cdeg v of a vertex v in a graph G are, respectively, the number of bridges and number of cycle edges incident with v in G. A characterization of finite nonempty sets S of nonnegative integers is given for which S is the set of bridge degrees (cycle degrees)…