MAXIMAL CLASSES FOR THE FAMILY OF QUASI-CONTINUOUS FUNCTIONS WITH CLOSED GRAPH
نویسندگان
چکیده
منابع مشابه
Rc-continuous Functions and Functions with Rc-strongly Closed Graph
The family of regular closed subsets of a topological space is used to introduce two concepts concerning a function f from a space X to a space Y . The first of them is the notion of f being rc-continuous. One of the established results states that a space Y is extremally disconnected if and only if each continuous function from a space X to Y is rc-continuous. The second concept studied is the...
متن کاملSquare Roots of Minor Closed Graph Classes
Let G be a graph class. The square root of G contains all graphs whose square belong in G. We prove that if G is non-trivial and minor closed, then all graphs in its square root have carving-width bounded by some constant depending only on G. As a consequence, every square root of such a graph class has a linear time recognition algorithm.
متن کاملAverages of Quasi-continuous Functions
The goal of this paper is to characterize the family of averages of comparable (Darboux) quasi-continuous functions.
متن کاملLine graphs associated to the maximal graph
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
متن کاملLearning Minor Closed Graph Classes with Membership and Equivalence Queries
The paper considers the problem of learning classes of graphs closed under taking minors It is shown that any such class can be properly learned in polynomial time using membership and equivalence queries The representation of the class is in terms of a set of minimal excluded minors obstruction set
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Demonstratio Mathematica
سال: 2009
ISSN: 2391-4661
DOI: 10.1515/dema-2009-0104