Let be any group with identity element (e) . A subgroup intersection graph of a subset is the Graph with V ( ) = - e and two separate peaks c and d contiguous for c and d if and only if , Where is a Periodic subset of resulting from . We find some topological indicators in this paper and Multi-border (Hosoya and Schultz) of , where , is aprime number.
With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied to some special graphs.
A topological index, commonly referred to as a connectivity index, is a molecular structural descriptor that describes a chemical compound's topology. Topological indices are a major topic in graph theory. In this paper, we first define a new graph, which is a concept from the coronavirus, called a corona graph, and then we give some theoretical results for the Wiener and the hyper Wiener index of a graph, according to ( the number of pairs of vertices (u, v) of G that are at a distance . Moreover, calculate some topological indices degree-based, such as the first and second Zagreb index, , and index, and first and second Gourava index for the recent graph. In addition, we introduced a new topological index, the , w
... Show MoreSuppose that is a finite group and is a non-empty subset of such that and . Suppose that is the Cayley graph whose vertices are all elements of and two vertices and are adjacent if and only if . In this paper, we introduce the generalized Cayley graph denoted by that is a graph with vertex set consists of all column matrices which all components are in and two vertices and are adjacent if and only if , where is a column matrix that each entry is the inverse of similar entry of and is matrix with all entries in , is the transpose of and . In this paper, we clarify some basic properties of the new graph and assign the structure of when is complete graph , complete bipartite graph and complete
... Show MoreLet be any connected graph with vertices set and edges set . For any two distinct vertices and , the detour distance between and which is denoted by is a longest path between and in a graph . The detour polynomial of a connected graph is denoted by ; and is defined by . In this paper, the detour polynomial of the theta graph and the uniform theta graph will be computed.
This dissertation depends on study of the topological structure in graph theory as well as introduce some concerning concepts, and generalization them into new topological spaces constructed using elements of graph. Thus, it is required presenting some theorems, propositions, and corollaries that are available in resources and proof which are not available. Moreover, studying some relationships between many concepts and examining their equivalence property like locally connectedness, convexity, intervals, and compactness. In addition, introducing the concepts of weaker separation axioms in α-topological spaces than the standard once like, α-feebly Hausdorff, α-feebly regular, and α-feebly normal and studying their properties. Furthermor
... Show MoreFor a finite group G, the intersection graph of G is the graph whose vertex set is the set of all proper non-trivial subgroups of G, where two distinct vertices are adjacent if their intersection is a non-trivial subgroup of G. In this article, we investigate the detour index, eccentric connectivity, and total eccentricity polynomials of the intersection graph of subgroups of the dihedral group for distinct primes . We also find the mean distance of the graph .
Topology and its applications occupy the interest of many researching centers in the advanced world. From this point of view and because the near open sets play a very important role in general topology and they are now the research topics of many topologists worldwide and its sets doesn’t enter in fibrewise topology yet. Therefore, we use some of the near open sets to be model for introduce results and new spaces in fibrewise topological spaces. Also, there is a very important role of closure operators in constructing a topological spaces, so we introduce a new closure operators on the power set of vertices on graphs and conclusion theorems and new spaces from it. Furthermore, we discuss the relationships of connectedness between some ty
... Show MoreIn a connected graph , the distance function between each pair of two vertices from a set vertex is the shortest distance between them and the vertex degree denoted by is the number of edges which are incident to the vertex The Schultz and modified Schultz polynomials of are have defined as:
respectively, where the summations are taken over all unordered pairs of distinct vertices in and is the distance between and in The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.
Maplesoft is a technical computation forms which is a heart of problem solving in mathematics especially in graph theory. Maplesoft has established itself as the computer algebra system for researchers. Maplesoft has more mathematical algorithms which is covering a wide range of applications. A new family ( ) of 6-bridge graph still not completely solved for chromatic number, chromatic polynomial and chromaticity. In this paper we apply maplesoft on a kind of 6-bridge graph ( ) to obtain chromatic number, chromatic polynomial and chromaticity. The computations are shown that graph contents 3 different colours for all vertices, 112410 different ways to colour a graph such that any two adjacent vertices have different colour by using 3 dif
... Show MoreIn this thesis, we study the topological structure in graph theory and various related results. Chapter one, contains fundamental concept of topology and basic definitions about near open sets and give an account of uncertainty rough sets theories also, we introduce the concepts of graph theory. Chapter two, deals with main concepts concerning topological structures using mixed degree systems in graph theory, which is M-space by using the mixed degree systems. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are defined and studied. In chapter three we study supra-approximation spaces using mixed degree systems and primary object in this chapter are two topological
... Show More