scholarly journals Analysis of the Graovac–Pisanski Index of Some Polyhedral Graphs Based on Their Symmetry Group

Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1411
Author(s):  
Modjtaba Ghorbani ◽  
Mardjan Hakimi-Nezhaad ◽  
Matthias Dehmer ◽  
Xueliang Li

The Graovac–Pisanski (GP) index of a graph is a modified version of the Wiener index based on the distance between each vertex x and its image α(x), where α is an automorphism of graph. The aim of this paper is to compute the automorphism group of some classes of cubic polyhedral graphs and then we determine their Wiener index. In addition, we investigate the GP-index of these classes of graphs.

2002 ◽  
Vol 34 (1) ◽  
pp. 37-45
Author(s):  
PETER BIRYUKOV ◽  
VALERY MISHKIN

A criterion of isomorphism for symmetry groups of set ideals is provided in terms of ideal quotients and cardinal invariants. Furthermore, set ideals with complete symmetry group are characterized. They form a wide class, comprising, for example, all uniform dense ideals and the ideals of ‘thin’ sets in separable metric spaces. If the symmetry group of a set ideal is not complete, then its outer automorphism group is shown to be cyclic of order 2.


2007 ◽  
Vol 17 (03) ◽  
pp. 935-951 ◽  
Author(s):  
FERNANDO ANTONELI ◽  
IAN STEWART

This paper continues the study of patterns of synchrony (equivalently, balanced colorings or flow-invariant subspaces) in symmetric coupled cell networks, and their relation to fixed-point spaces of subgroups of the symmetry group. Let Γ be a permutation group acting on the set of cells. We define the group network [Formula: see text], whose architecture is entirely determined by the group orbits of Γ. We prove that if Γ has the "balanced extension property" then every balanced coloring of [Formula: see text] is a fixed-point coloring relative to the automorphism group of the group network. This theorem applies in particular when Γ is cyclic or dihedral, acting on cells as the symmetries of a regular polygon, and in these cases the automorphism group is Γ itself. In general, however, the automorphism group may be larger than Γ. Several examples of this phenomenon are discussed, including the finite simple group of order 168 in its permutation representation of degree 7. More dramatically, for some choices of Γ there exist balanced colorings of [Formula: see text] that are not fixed-point colorings. For example, there exists an exotic balanced 2-coloring when Γ is the symmetry group of the two-dimensional square lattice. This coloring is doubly periodic, and its reduction modulo 8 leads to a finite group with similar properties. Although these patterns do not arise from fixed-point spaces, we provide a group-theoretic explanation of their balance property in terms of a sublattice of index two.


2020 ◽  
pp. 1-24
Author(s):  
B. Monson ◽  
Egon Schulte

Abstract In the classical setting, a convex polytope is said to be semiregular if its facets are regular and its symmetry group is transitive on vertices. This paper continues our study of alternating semiregular abstract polytopes, which have abstract regular facets, still with combinatorial automorphism group transitive on vertices and with two kinds of regular facets occurring in an alternating fashion. Our main concern here is the universal polytope ${\mathcal{U}}_{{\mathcal{P}},{\mathcal{Q}}}$ , an alternating semiregular $(n+1)$ -polytope defined for any pair of regular $n$ -polytopes ${\mathcal{P}},{\mathcal{Q}}$ with isomorphic facets. After a careful look at the local structure of these objects, we develop the combinatorial machinery needed to explain how ${\mathcal{U}}_{{\mathcal{P}},{\mathcal{Q}}}$ can be constructed by “freely assembling” unlimited copies of  ${\mathcal{P}}$ , ${\mathcal{Q}}$ along their facets in alternating fashion. We then examine the connection group of ${\mathcal{U}}_{{\mathcal{P}},{\mathcal{Q}}}$ , and from that prove that ${\mathcal{U}}_{{\mathcal{P}},{\mathcal{Q}}}$ covers any $(n+1)$ -polytope ${\mathcal{B}}$ whose facets alternate in any way between various quotients of ${\mathcal{P}}$ or  ${\mathcal{Q}}$ .


2020 ◽  
Vol 51 (2) ◽  
pp. 125-146
Author(s):  
Nasiruddin Nasiruddin ◽  
Yu Zhangxin ◽  
Ting Zhao Chen Guangying ◽  
Minghui Ji

We grew cucumber in pots in greenhouse for 9-successive cropping cycles and analyzed the rhizosphere Pseudomonas spp. community structure and abundance by PCR-denaturing gradient gel electrophoresis and quantitative PCR. Results showed that continuous monocropping changed the cucumber rhizosphere Pseudomonas spp. community. The number of DGGE bands, Shannon-Wiener index and Evenness index decreased during the 3rd cropping and thereafter, increased up to the 7th cropping, however, however, afterwards they decreased again. The abundance of Pseudomonas spp. increased up to the 5th successive cropping and then decreased gradually. These findings indicated that the structure and abundance of Pseudomonas spp. community changed with long-term cucumber monocropping, which might be linked to soil sickness caused by its continuous monocropping.


2018 ◽  
Vol 9 (11) ◽  
pp. 1712-1716
Author(s):  
R. Palanikumar ◽  
A. Rameshkumar
Keyword(s):  

2020 ◽  
Vol 3 (1) ◽  
pp. 28-36 ◽  
Author(s):  
Andrey A. Dobrynin ◽  
◽  
Ehsan Estaji ◽  
◽  
Keyword(s):  

2020 ◽  
Vol 27 (1) ◽  
pp. 54-77 ◽  
Author(s):  
Bogdan Bumbăcilă ◽  
Mihai V. Putz

Pesticides are used today on a planetary-wide scale. The rising need for substances with this biological activity due to an increasing consumption of agricultural and animal products and to the development of urban areas makes the chemical industry to constantly investigate new molecules or to improve the physicochemical characteristics, increase the biological activities and improve the toxicity profiles of the already known ones. Molecular databases are increasingly accessible for in vitro and in vivo bioavailability studies. In this context, structure-activity studies, by their in silico - in cerebro methods, are used to precede in vitro and in vivo studies in plants and experimental animals because they can indicate trends by statistical methods or biological activity models expressed as mathematical equations or graphical correlations, so a direction of study can be developed or another can be abandoned, saving financial resources, time and laboratory animals. Following this line of research the present paper reviews the Structure-Activity Relationship (SAR) studies and proposes a correlation between a topological connectivity index and the biological activity or toxicity made as a result of a study performed on 11 molecules of organophosphate compounds, randomly chosen, with a basic structure including a Phosphorus atom double bounded to an Oxygen atom or to a Sulfur one and having three other simple covalent bonds with two alkoxy (-methoxy or -ethoxy) groups and to another functional group different from the alkoxy groups. The molecules were packed on a cubic structure consisting of three adjacent cubes, respecting a principle of topological efficiency, that of occupying a minimal space in that cubic structure, a method that was called the Clef Method. The central topological index selected for correlation was the Wiener index, since it was possible this way to discuss different adjacencies between the nodes in the graphs corresponding to the organophosphate compounds molecules packed on the cubic structure; accordingly, "three dimensional" variants of these connectivity indices could be considered and further used for studying the qualitative-quantitative relationships for the specific molecule-enzyme interaction complexes, including correlation between the Wiener weights (nodal specific contributions to the total Wiener index of the molecular graph) and the biochemical reactivity of some of the atoms. Finally, when passing from SAR to Q(uantitative)-SAR studies, especially by the present advanced method of the cubic molecule (Clef Method) and its good assessment of the (neuro)toxicity of the studied molecules and of their inhibitory effect on the target enzyme - acetylcholinesterase, it can be seen that a predictability of the toxicity and activity of different analogue compounds can be ensured, facilitating the in vivo experiments or improving the usage of pesticides.


2019 ◽  
Vol 39 (1) ◽  
pp. 170-184 ◽  
Author(s):  
Stéphane Bessy ◽  
François Dross ◽  
Katarína Hriňáková ◽  
Martin Knor ◽  
Riste Škrekovski
Keyword(s):  

Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 17 ◽  
Author(s):  
Abdollah Alhevaz ◽  
Maryam Baghipur ◽  
Hilal A. Ganie ◽  
Yilun Shang

The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.


Sign in / Sign up

Export Citation Format

Share Document