Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
Introduction/purpose: A graph as a mathematical object occupies a special place in science. Graph theory is increasingly used in many spheres of business and scientific fields. This paper analyzes pentagonal cactus chains, a special type of graphs composed of pentagonal cycles in which two adjacent cycles have only one node in common. The aim of the research is to determine the dominant set and the dominance number on ortho and meta pentagonal cactus chains. Methods: When the corresponding destinations are treated as graph nodes and the connections between them as branches in the graph, the complete structure of the graph is obtained, to which the laws of graph theory are applied. The vertices of the pentagon are treated as nodes of the graph and the sides as branches in the graph. By applying mathematical methods, the dominance was determined on one pentagon, then on two pentagons with a common node, and then on ortho and meta pentagonal cactus chains. Results: The research has shown that the dominance number on the ortho chain 𝑂ℎ of the length h ≥ 2 is equal to the value of the expression ⌈ 3ℎ 2 ⌉ while on the meta chain 𝑀ℎ it is equal to the value of the expression h+1, which was proven in this paper. Conclusion: The results show that the dominant sets and the dominance numbers on ortho and meta pentagonal cactus chains are determined and explicitly expressed by mathematical expressions. They also point to the possibility of their application in the fields of science as well as in the spheres of business in which these structures appear.
Introduction/purpose: A graph as a mathematical object occupies a special place in science. Graph theory is increasingly used in many spheres of business and scientific fields. This paper analyzes pentagonal cactus chains, a special type of graphs composed of pentagonal cycles in which two adjacent cycles have only one node in common. The aim of the research is to determine the dominant set and the dominance number on ortho and meta pentagonal cactus chains. Methods: When the corresponding destinations are treated as graph nodes and the connections between them as branches in the graph, the complete structure of the graph is obtained, to which the laws of graph theory are applied. The vertices of the pentagon are treated as nodes of the graph and the sides as branches in the graph. By applying mathematical methods, the dominance was determined on one pentagon, then on two pentagons with a common node, and then on ortho and meta pentagonal cactus chains. Results: The research has shown that the dominance number on the ortho chain 𝑂ℎ of the length h ≥ 2 is equal to the value of the expression ⌈ 3ℎ 2 ⌉ while on the meta chain 𝑀ℎ it is equal to the value of the expression h+1, which was proven in this paper. Conclusion: The results show that the dominant sets and the dominance numbers on ortho and meta pentagonal cactus chains are determined and explicitly expressed by mathematical expressions. They also point to the possibility of their application in the fields of science as well as in the spheres of business in which these structures appear.
Introduction/purpose: Chemical structures are conveniently represented by graphs where atoms are nodes (vertices) and chemical bonds are branches (lines) in the graph. A graphical representation of a molecule provides a lot of useful information about the chemical properties of the molecule. It is known that numerous physical and chemical properties of molecules are highly correlated with theoretical invariants of graphs, which we call topological indices. One such theoretical invariant is the dominance number. The aim of this research is to determine the k-dominance number for cyclooctane chains 𝐶𝑂𝐶𝑛 1 , 𝐶𝑂𝐶𝑛 2 , 𝐶𝑂𝐶𝑛 3 and 𝐶𝑂𝐶𝑛 4 , for k ∈ {1,2,3}, n ∈ 𝑁. Methods: The cyclooctane chain is a chain of octagons connected by a single line. The vertices of the octagon are treated as nodes of the graph, and the sides and the line connecting them, as branches in the graph. Using mathematical methods, k-dominance was determined on one octagon, k∈{1,2,3}. Then, by representing the cyclooctane chains 𝐶𝑂𝐶𝑛 1 , 𝐶𝑂𝐶𝑛 2 , 𝐶𝑂𝐶𝑛 3 and 𝐶𝑂𝐶𝑛 4 , in a convenient, isomorphic way, we determined their k-dominance number, k∈{ 1,2,3}. Results: Determining k-dominance, k∈{1,2,3}, for 4 cyclooctane chains 𝐶𝑂𝐶𝑛 1 , 𝐶𝑂𝐶𝑛 2 , 𝐶𝑂𝐶𝑛 3 and 𝐶𝑂𝐶𝑛 4 , we obtained 12 different formulas to calculate their k-dominance number. All formulas are composed of several alternative algebraic expressions, the selection of which is conditioned by the divisibility of the number n by the number 2, 3 or 4, depending on the type of cyclooctane chain and k-dominance to be determined. The results of the research are fully presented in the paper through mathematically proven theorems and graphical representations. Conclusion: The results show that the k-dominance numbers, k∈{1,2,3}, on cyclooctane chains 𝐶𝑂𝐶𝑛 1 , 𝐶𝑂𝐶𝑛 2 , 𝐶𝑂𝐶𝑛 3 and 𝐶𝑂𝐶𝑛 4 , are determined and explicitly expressed by mathematical expressions. They also indicate the possibility of their application in molecular graphs of cyclooctane rings, in computational chemistry, chemical and biological industry.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2025 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.