This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.
The theory of general topology view for continuous mappings is general version and is applied for topological graph theory. Separation axioms can be regard as tools for distinguishing objects in information systems. Rough theory is one of map the topology to uncertainty. The aim of this work is to presented graph, continuity, separation properties and rough set to put a new approaches for uncertainty. For the introduce of various levels of approximations, we introduce several levels of continuity and separation axioms on graphs in Gm-closure approximation spaces.
The idea of ech fuzzy soft bi-closure space ( bicsp) is a new one, and its basic features are defined and studied in [1]. In this paper, separation axioms, namely pairwise, , pairwise semi-(respectively, pairwise pseudo and pairwise Uryshon) - fs bicsp's are introduced and studied in both ech fuzzy soft bi-closure space and their induced fuzzy soft bitopological spaces. It is shown that hereditary property is satisfied for , with respect to ech fuzzy soft bi-closure space but for other mentioned types of separations axioms, hereditary property satisfies for closed subspaces of ech fuzzy soft bi-closure space.
A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.
The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.
Consider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph make up the graph's quotient energy. The objective of this study is to examine the quotient energy of identity graphs and zero-divisor graphs of commutative rings using group theory, graph theory, and applications. In this study, the identity graphs derived from the group and a few classes of zero-divisor graphs of the commutative ring R are examined.
We use the idea of the grill. This study generalized a new sort of linked space like -connected and -hyperconnected and investigated its features, as well as the relationship between it and previously described notions. It also developed new sorts of functions, such as hyperconnected space, and identified their relationship by offering numerous instances and attributes that belong to this set. This set will serve as a starting point for further research into the set many future possibilities. We also use some theorems and observations previously studied and related to the grill and the semi-open to obtain results in this research. We applied the concept of connected to them and obtained results related to connected. The sources related t
... Show MoreF index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in understanding the biological activities. Among all the topological indices, the forgotten index is based on degree connectivity on bonds. This paper characterized the forgotten index of union of graphs, join graphs, limits on trees and its complements, and accuracy is measured. Co-index values are analyzed for the various molecular structure of chemical compounds
The main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that may be infinite. Furthermore, we offered some properties of such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.