Ptolemy Scientific Research Press (PSR Press)is a highly regarded publisher of scientific literature dedicated to bringing the latest research and findings to a broader audience. With a focus on cutting-edge research and technology, Ptolemy Scientific Research Press offers a range of publications catering to professionals, researchers, and student’s needs. Whether looking for information on the latest breakthroughs in physics, biology, engineering, or computer science, you can trust Ptolemy Scientific Research Press to deliver insightful, accurate, and engaging content. With its commitment to quality, accessibility, and innovation, Ptolemy Scientific Research Press is an essential resource for anyone interested in science and technology.

Latest Published Articles

Calculating Degree Based Topological Indices of Line Graph of \(HAC_{5}C_{6}C_{7}[p,q]\) Nanotube via M-Polynomial

OJC-Vol. 1 (2018), Issue 2, pp. 01–10 | Open Access Full-Text PDF
Aziz ur Rehman, Waseem Khalid
Abstract:The application of graph theory in chemical and molecular structure research far exceeds people’s expectations, and it has recently grown exponentially. In the molecular graph, atoms are represented by vertices and bonded by edges. In this report, we study the M-polynomial of line graph of \(HAC_{5}C_{6}C_{7}[p,q]\) and recover many degree-based topological indices from it.
Read Full Article

Zagreb Polynomials and redefined Zagreb indices of line graph of \(HAC_{5}C_{6}C_{7}[p,q]\) Nanotube

OJC-Vol. 1 (2018), Issue 1, pp. 26–35 | Open Access Full-Text PDF
Aziz ur Rehman, Waseem Khalid
Abstract:The application of graph theory in chemical and molecular structure research far exceeds people’s expectations, and it has recently grown exponentially. In the molecular graph, atoms are represented by vertices and bonded by edges. In this report, we study the Zagreb-polynomials of line graph of \(HAC_{5}C_{6}C_{7}[p,q]\) and compute some degree-based topological indices from it.
Read Full Article

On Torsion and Finite Extension of \(FC\) and \(\tau N_{K}\) Groups in Certain Classes of Finitely Generated Groups

OMS-Vol. 2 (2018), Issue 1, pp. 351–360 Open Access Full-Text PDF
Mourad Chelgham, Mohamed Kerada
Abstract:Let \(k>0\) an integer. \(F\), \(\tau \), \(N\), \(N_{k}\), \(N_{k}^{(2)}\) and \(A\) denote the classes of finite, torsion, nilpotent, nilpotent of class at most \(k\), group which every two generator subgroup is \(N_{k}\) and abelian groups respectively. The main results of this paper is, firstly, we prove that, in the class of finitely generated \(\tau N\)-group (respectively \(FN\)-group) a \((FC)\tau \)-group (respectively \((FC)F\)-group) is a \(\tau A\)-group (respectively is \(FA\)-group). Secondly, we prove that a finitely generated \(\tau N\)-group (respectively \(FN\)-group) in the class \(((\tau N_{k})\tau ,\infty)\) (respectively \(((FN_{k})F,\infty)\)) is a \(\tau N_{k}^{(2)}\)-group (respectively \(FN_{k}^{(2)}\)-group). Thirdly we prove that a finitely generated \(\tau N\)-group ( respectively \(FN\)-group) in the class \(((\tau N_{k})\tau ,\infty)^{\ast}\) (respectively \(((FN_{k})F,\infty)^{\ast}\)) is a \(\tau N_{c}\)-group (respectively \(FN_{c}\)-group) for certain integer \(c\) and we extend this results to the class of \(NF\)-groups.
Read Full Article

Computing Reformulated First Zagreb Index of Some Chemical Graphs as an Application of Generalized Hierarchical Product of Graphs

OMS-Vol. 2 (2018), Issue 1, pp. 338–350 Open Access Full-Text PDF
Nilanjan De
Abstract:The generalized hierarchical product of graphs was introduced by L. Barrière et al. in 2009. In this paper, reformulated first Zagreb index of generalized hierarchical product of two connected graphs and hence as a special case cluster product of graphs are obtained. Finally using the derived results the reformulated first Zagreb index of some chemically important graphs such as square comb lattice, hexagonal chain, molecular graph of truncated cube, dimer fullerene, zig-zag polyhex nanotube and dicentric dendrimers are computed.
Read Full Article

Characterizing Trees with Minimal ABC Index with Computer Search: A Short Survey

ODAM-Vol. 1 (2018), Issue 2, pp. 01–09 | Open Access Full-Text PDF
Yiming Zheng, Wenshui Lin, Qi’an Chen, Linshan Huang, Zhixi Wu
Abstract:The atom-bond connectivity (ABC) index of a graph \(G=(V,E)\) is defined as \(ABC(G)=\sum_{v _{i}v_{j} \in E}\sqrt{(d_{i}+d_{j}-2)/(d_{i}d_{j})}\), where \(d_{i}\) denotes the degree of vertex \(v_{i}\) of \(G\). Due to its interesting applications in chemistry, this molecular structure descriptor has become one of the most actively studied vertex-degree-based graph invariants. Many efforts were made towards the elementary problem of characterizing tree(s) with minimal ABC index, which remains open and was coined as the ABC index conundrum”. Up to date, quite a few significant results have been obtained. In the course of research computer search plays a non-negligible role. In the present paper we review the state of the art of the problem. In addition we intend to demonstrate that, repeating the procedure “searching – conjecturing – proving” can be an applicable paradigm to cope with elusive problems of extremal graph characterization.
Read Full Article
BOOK-foundations-of-mathematical-analysis-and-semigroups-theory
BOOK - NULL CONTROLLABILITY OF DEGENERATE AND NON-DEGENERATE SINGULAR PARABOLIC