OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS
نویسندگان
چکیده
منابع مشابه
On Open Packing Number of Graphs
In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.
متن کاملon open packing number of graphs
in a graph g = (v,e), a subset s v is said to be an open packing set if no two vertices of s have a common neighbour in g. the maximum cardinality of an open packing set is called the open packing number and is denoted by rho^o. this paper further studies on this parameter by obtaining some new bounds.
متن کاملAsteroidal number for some product graphs
The notion of Asteroidal triples was introduced by Lekkerkerker and Boland [6]. D.G.Corneil and others [2], Ekkehard Kohler [3] further investigated asteroidal triples. Walter generalized the concept of asteroidal triples to asteroidal sets [8]. Further study was carried out by Haiko Muller [4]. In this paper we find asteroidal numbers for Direct product of cycles, Direct product of path and cy...
متن کاملClasses of perfect graphs
The Strong Perfect Graph Conjecture, suggested by Claude Berge in 1960, had a major impact on the development of graph theory over the last forty years. It has led to the definitions and study of many new classes of graphs for which the Strong Perfect Graph Conjecture has been verified. Powerful concepts and methods have been developed to prove the Strong Perfect Graph Conjecture for these spec...
متن کاملApproximating Treewidth and Pathwidth of some Classes of Perfect Graphs
In this paper we discuss the problem of finding approximations for the treewidth and pathwidth of cotriangulated graphs, convex graphs, permutation graphs and of cocomparability graphs. For a cotriangulated graph, of which the treewidth is at most k, the pathwidth is at most 3k + 4 and we show there exists an O( n2 ) algorithm finding a path-decomposition with width at most 3k + 4. For convex g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ural Mathematical Journal
سال: 2020
ISSN: 2414-3952
DOI: 10.15826/umj.2020.2.004