25 hasil untuk "Gary Chartrand"
Menampilkan 1–20 · 0,87 detik · RSS
-
Artikel Jurnal
Ramsey sequences of graphs
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…
-
Artikel Jurnal Teks lengkap
Locally Irregular-Connected Graphs
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…
-
Artikel Jurnal Teks lengkap
Strong Ramsey Numbers of Graphs of Size 4
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…
-
Artikel Jurnal Teks lengkap
Strong Ramsey Numbers of All Sets of Three Graphs of Size 3
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…
-
Artikel Jurnal Teks lengkap
Ramsey Chains in Linear Forests
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…
-
Artikel Jurnal
On subset labelings of trees
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]…
-
Artikel Jurnal
The hull number of an oriented graph
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.
-
Artikel Jurnal
Bridge and cycle degrees of vertices of graphs
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)…