Algorithms for generalized stability numbers of tree graphs
نویسندگان
چکیده
منابع مشابه
Pegging Numbers For Various Tree Graphs
In the game of pegging, each vertex of a graph is considered a hole into which a peg can be placed. A pegging move is performed by jumping one peg over another peg, and then removing the peg that has been jumped over from the graph. We define the pegging number as the smallest number of pegs needed to reach all the vertices in a graph no matter what the distribution. Similarly, the optimal-pegg...
متن کاملRadio numbers for generalized prism graphs
A radio labeling is an assignment c : V (G) → N such that every distinct pair of vertices u, v satisfies the inequality d(u, v) + |c(u) − c(v)| ≥ diam(G) + 1. The span of a radio labeling is the maximum value. The radio number of G, rn(G), is the minimum span over all radio labelings of G. Generalized prism graphs, denoted Zn,s, s ≥ 1, n ≥ s, have vertex set {(i, j) | i = 1, 2 and j = 1, . . . ...
متن کاملIncidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
متن کاملAlgorithms for Unipolar and Generalized Split Graphs
A graph G = (V,E) is a unipolar graph if there exits a partition V = V1 ∪ V2 such that, V1 is a clique and V2 induces the disjoint union of cliques. The complement-closed class of generalized split graphs are those graphs G such that either G or the complement of G is unipolar. Generalized split graphs are a large subclass of perfect graphs. In fact, it has been shown that almost all C5-free (a...
متن کاملGeneralized Split Graphs and Ramsey Numbers
A graph G is called a ( p, q)-split graph if its vertex set can be partitioned into A, B so that the order of the largest independent set in A is at most p and the order of the largest complete subgraph in B is at most q. Applying a well-known theorem of Erdo s and Rado for 2-systems, it is shown that for fixed p, q, ( p, q)-split graphs can be characterized by excluding a finite set of forbidd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 1966
ISSN: 0004-9735
DOI: 10.1017/s1446788700004031