Log in

Relevant bibliographies by topics / Eccentric mathematics / Journal articles

To see the other types of publications on this topic, follow the link: Eccentric mathematics.

Journal articles on the topic 'Eccentric mathematics'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Eccentric mathematics.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Prasanna, A., та N. Mohamedazarudeen. "Connected 𝐷 - Eccentric Domination in Graphs". Indian Journal Of Science And Technology 17, № 36 (2024): 3776–80. http://dx.doi.org/10.17485/ijst/v17i36.2672.

Full text

Abstract:

Objectives: To introduce connected -eccentric point set, connected -eccentric number, connected -eccentric dominating set, connected -eccentric domination number in a graph and related concepts. Methods: -distance in graphs are used to find the connected -eccentric number and connected -eccentric domination number in graphs. Findings: The new term connected -eccentric domination in graphs are used in varies field like to construct least number of cell phone tower in low cost and traffic signal also. Novelty: Using the idea -distance, eccentricity in a graphs, the connected -eccentric dominatin

APA, Harvard, Vancouver, ISO, and other styles

2

A, Prasanna, та Mohamedazarudeen N. "Connected 𝐷 - Eccentric Domination in Graphs". Indian Journal of Science and Technology 17, № 36 (2024): 3776–80. https://doi.org/10.17485/IJST/v17i36.2672.

Full text

Abstract:

Abstract <strong>Objectives:</strong> To introduce connected -eccentric point set, connected -eccentric number, connected -eccentric dominating set, connected -eccentric domination number in a graph and related concepts. <strong>Methods:</strong> -distance in graphs are used to find the connected -eccentric number and connected -eccentric domination number in graphs. <strong>Findings:</strong> The new term connected -eccentric domination in graphs are used in varies field like to construct least number of cell phone tower in low cost and traffic signal also. <stro

APA, Harvard, Vancouver, ISO, and other styles

3

Akiyama, Jin, Kiyoshi Ando, and David Avis. "Eccentric graphs." Discrete Mathematics 56, no. 1 (1985): 1–6. http://dx.doi.org/10.1016/0012-365x(85)90188-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Boland, James, Fred Buckley, and Mirka Miller. "Eccentric digraphs." Discrete Mathematics 286, no. 1-2 (2004): 25–29. http://dx.doi.org/10.1016/j.disc.2003.11.041.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hak, Artem, Vladyslav Haponenko, Sergiy Kozerenko, and Andrii Serdiuk. "Unique eccentric point graphs and their eccentric digraphs." Discrete Mathematics 346, no. 12 (2023): 113614. http://dx.doi.org/10.1016/j.disc.2023.113614.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wang, Hongzhuan, Xianhao Shi, and Ber-Lin Yu. "On the eccentric connectivity coindex in graphs." AIMS Mathematics 7, no. 1 (2021): 651–66. http://dx.doi.org/10.3934/math.2022041.

Full text

Abstract:

<abstract><p>The well-studied eccentric connectivity index directly consider the contribution of all edges in a graph. By considering the total eccentricity sum of all non-adjacent vertex, Hua et al. proposed a new topological index, namely, eccentric connectivity coindex of a connected graph. The eccentric connectivity coindex of a connected graph $ G $ is defined as</p> <p><disp-formula> <label/> <tex-math id="FE1"> \begin{document}$ \overline{\xi}^{c}(G) = \sum\limits_{uv\notin E(G)} (\varepsilon_{G}(u)+\varepsilon_{G}(v)). $\end{document} </tex-

APA, Harvard, Vancouver, ISO, and other styles

7

Akhter, Shehnaz, and Rashid Farooq. "The eccentric adjacency index of unicyclic graphs and trees." Asian-European Journal of Mathematics 13, no. 01 (2018): 2050028. http://dx.doi.org/10.1142/s179355712050028x.

Full text

Abstract:

Let [Formula: see text] be a simple connected graph with vertex set [Formula: see text] and edge set [Formula: see text]. The eccentricity [Formula: see text] of a vertex [Formula: see text] in [Formula: see text] is the largest distance between [Formula: see text] and any other vertex of [Formula: see text]. The eccentric adjacency index (also known as Ediz eccentric connectivity index) of [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the sum of degrees of neighbors of the vertex [Formula: see text]. In this paper, we determine the unicyclic graphs with l

APA, Harvard, Vancouver, ISO, and other styles

8

Unt, V. "ECCENTRIC INTERACTING ELECTRON." Proceedings of the Estonian Academy of Sciences. Physics. Mathematics 44, no. 4 (1995): 459. http://dx.doi.org/10.3176/phys.math.1995.4.05.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Shan, Qifeng, Jingming Cai, Xiaopeng Li, and Jiawei Tan. "Analysis of Concrete-Filled Square Steel Tube Short Columns under Eccentric Loading." Mathematical Problems in Engineering 2019 (June 20, 2019): 1–12. http://dx.doi.org/10.1155/2019/8420181.

Full text

Abstract:

The concrete-filled square steel tube (CFSST) columns have been widely applied in structural engineering. Although many constitutive models have been proposed to describe CFSST short columns under concentric loading, the applicability of the existing concentric model in the analysis of CFSST short columns under eccentric loading has not been properly verified. In this paper, the eccentric behaviors of CFSST short columns were investigated with the software of ABAQUS/standard. It was found that the contact stress between steel tube and inner concrete was seriously affected by eccentric ratios,

APA, Harvard, Vancouver, ISO, and other styles

10

Azari, Mahdieh. "Eccentric connectivity coindex under graph operations." Journal of Applied Mathematics and Computing 62, no. 1-2 (2019): 23–35. http://dx.doi.org/10.1007/s12190-019-01271-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Mukungunugwa, Vivian, and Simon Mukwembi. "On Eccentric Connectivity Index and Connectivity." Acta Mathematica Sinica, English Series 35, no. 7 (2019): 1205–16. http://dx.doi.org/10.1007/s10114-019-7320-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Kyš, Peter. "Graphs with the same peripheral and center eccentric vertices." Mathematica Bohemica 125, no. 3 (2000): 331–39. http://dx.doi.org/10.21136/mb.2000.126124.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Azari, Mahdieh. "Multiplicative version of eccentric connectivity index." Discrete Applied Mathematics 310 (March 2022): 32–42. http://dx.doi.org/10.1016/j.dam.2021.12.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Xu, Kexiang, Aleksandar Ilić, Vesna Iršič, Sandi Klavžar, and Huimin Li. "Comparing Wiener complexity with eccentric complexity." Discrete Applied Mathematics 290 (February 2021): 7–16. http://dx.doi.org/10.1016/j.dam.2020.11.020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Imran, Muhammad, Shehnaz Akhter та Zahid Iqbal. "On the Eccentric Connectivity Polynomial of ℱ-Sum of Connected Graphs". Complexity 2020 (31 травня 2020): 1–9. http://dx.doi.org/10.1155/2020/5061682.

Full text

Abstract:

The eccentric connectivity polynomial (ECP) of a connected graph G=VG,EG is described as ξcG,y=∑a∈VGdegGayecGa, where ecGa and degGa represent the eccentricity and the degree of the vertex a, respectively. The eccentric connectivity index (ECI) can also be acquired from ξcG,y by taking its first derivatives at y=1. The ECI has been widely used for analyzing both the boiling point and melting point for chemical compounds and medicinal drugs in QSPR/QSAR studies. As the extension of ECI, the ECP also performs a pivotal role in pharmaceutical science and chemical engineering. Graph products conve

APA, Harvard, Vancouver, ISO, and other styles

16

Gimbert, Joan, Nacho López, Mirka Miller, and Joseph Ryan. "Characterization of eccentric digraphs." Discrete Mathematics 306, no. 2 (2006): 210–19. http://dx.doi.org/10.1016/j.disc.2005.11.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Haritha, T., and A. V. Chithra. "On the Distance Spectrum and Distance-Based Topological Indices of Central Vertex-Edge Join of Three Graphs." Armenian Journal of Mathematics 15, no. 10 (2023): 1–16. http://dx.doi.org/10.52737/18291163-2023.15.10-1-16.

Full text

Abstract:

In this paper, we introduce a new graph operation based on a central graph called central vertex-edge join (denoted by $G_{n_1}^C \triangleright (G_{n_2}^V\cup G_{n_3}^E)$) and then determine the distance spectrum of $G_{n_1}^C \triangleright (G_{n_2}^V\cup G_{n_3}^E)$ in terms of the adjacency spectra of regular graphs $G_1$, $G_2$ and $G_3$ when $G_1$ is triangle-free. As a consequence of this result, we construct new families of non-D-cospectral D-equienergetic graphs. Moreover, we determine bounds for the distance spectral radius and distance energy of the central vertex-edge join of three

APA, Harvard, Vancouver, ISO, and other styles

18

Gamorez, Anabel, and Sergio Canoy Jr. "Monophonic Eccentric Domination Numbers of Graphs." European Journal of Pure and Applied Mathematics 15, no. 2 (2022): 635–45. http://dx.doi.org/10.29020/nybg.ejpam.v15i2.4354.

Full text

Abstract:

Let G be a (simple) undirected graph with vertex and edge sets V (G) and E(G), respectively. A set S ⊆ V (G) is a monophonic eccentric dominating set if every vertex in V (G) \ S has a monophonic eccentric vertex in S. The minimum size of a monophonic eccentric dominating set in G is called the monophonic eccentric domination number of G. It is shown that the absolute difference of the domination number and monophonic eccentric domination number of a graph can be made arbitrarily large. We characterize the monophonic eccentric dominating sets in graphs resulting from the join, corona, and lexi

APA, Harvard, Vancouver, ISO, and other styles

19

Ghalavand, Ali, Shiladhar Pawar, and Nandappa D. Soner. "Leap Eccentric Connectivity Index of Subdivision Graphs." Journal of Mathematics 2022 (September 19, 2022): 1–7. http://dx.doi.org/10.1155/2022/7880336.

Full text

Abstract:

The second degree of a vertex in a simple graph is defined as the number of its second neighbors. The leap eccentric connectivity index of a graph M , L ξ c M , is the sum of the product of the second degree and the eccentricity of every vertex in M . In this paper, some lower and upper bounds of L ξ c S M in terms of the numbers of vertices and edges, diameter, and the first Zagreb and third leap Zagreb indices are obtained. Also, the exact values of L ξ c S M for some well-known graphs are computed.

APA, Harvard, Vancouver, ISO, and other styles

20

Hua, Hongbo, Shenggui Zhang, and Kexiang Xu. "Further results on the eccentric distance sum." Discrete Applied Mathematics 160, no. 1-2 (2012): 170–80. http://dx.doi.org/10.1016/j.dam.2011.10.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Zhang, Xiu-Mei, Hua Wang, and Xiao-Dong Zhang. "On the eccentric subtree number in trees." Discrete Applied Mathematics 290 (February 2021): 123–32. http://dx.doi.org/10.1016/j.dam.2019.08.026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Hua, Hongbo. "On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2." Discrete Applied Mathematics 285 (October 2020): 297–300. http://dx.doi.org/10.1016/j.dam.2020.06.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Bhanumathi, M., and R. Meenal Abirami. "Upper eccentric domination in graphs." Journal of Discrete Mathematical Sciences and Cryptography 22, no. 5 (2019): 835–46. http://dx.doi.org/10.1080/09720529.2019.1685236.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Li, Yujia, Tao Ren, Jinnan Zhang, and Minghong Zhang. "Synchronization of Two Eccentric Rotors Driven by One Motor with Two Flexible Couplings in a Spatial Vibration System." Mathematical Problems in Engineering 2019 (April 7, 2019): 1–13. http://dx.doi.org/10.1155/2019/2969687.

Full text

Abstract:

A dynamic model of a vibration system, in which eccentric rotors are driven by one motor with two flexible couplings, is developed in this study. The Lagrange equation is used to analyze the dynamic behavior of the vibration system. Synchronization theory and its motion law are investigated using Hamilton’s principle, and the validity of the theory is proven through numerical simulation and experimentation. Results show that the system has two synchronous motions, namely, 0 and π phases. When the torsional stiffness difference between two flexible couplings on both sides of the motor or the re

APA, Harvard, Vancouver, ISO, and other styles

25

Su, Liang-Shen, Chi-Hao Lin, and Kuo-Ching Chen. "On the response of eccentric non-structures subjected to horizontal oscillation." Journal of Mechanics 38 (2022): 560–67. http://dx.doi.org/10.1093/jom/ufac040.

Full text

Abstract:

ABSTRACT In contrast to building structures, little attention has been paid to the seismic performance of non-structures in buildings, especially of eccentric non-structures. This paper attempts to explore the rocking and overturning of eccentric blocks, which could be the equipment or non-structural components in buildings, subjected to horizontal vibration. In the present study, a non-structure is regarded as a rigid block with tunable mass eccentricity, and the contact friction is assumed to be large enough to prevent the rigid block from sliding. A free shaking test is first carried out to

APA, Harvard, Vancouver, ISO, and other styles

26

Morgan, M. J., S. Mukwembi, and H. C. Swart. "Extremal regular graphs for the eccentric connectivity index." Quaestiones Mathematicae 37, no. 3 (2014): 435–44. http://dx.doi.org/10.2989/16073606.2014.894676.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

GHORBANI, M., M. A. HOSSEINZADEH, M. V. DIUDEA, and A. R. ASHRAFI. "Modified eccentric connectivity polynomial of some graph operations." Carpathian Journal of Mathematics 28, no. 2 (2012): 247–56. http://dx.doi.org/10.37193/cjm.2012.02.12.

Full text

Abstract:

The modified eccentricity connectivity polynomial of a connected graph G is defined as ... where... εG(v) and dG(u) is the degree of u in G. In this paper modified eccentric connectivity polynomial is computed for several classes of composite graphs.

APA, Harvard, Vancouver, ISO, and other styles

28

Jennings, L. S., K. H. Wong, and K. L. Teo. "Optimal control computation to account for eccentric movement." Journal of the Australian Mathematical Society. Series B. Applied Mathematics 38, no. 2 (1996): 182–93. http://dx.doi.org/10.1017/s0334270000000576.

Full text

Abstract:

AbstractA class of optimal control models which involve different weightings in the integrand of the objective function is considered. The motivation for considering this class of problems is that this type of objective function is used to account for eccentric movement in biomechanical models. The computation of these optimal control problems using control parametrization directly is difficult, firstly because of ill-conditioning, and secondly because the objective function is not differentiable. A method for smoothing the integrand is presented with convergence results. An example is compute

APA, Harvard, Vancouver, ISO, and other styles

29

Ghalavand, Ali, Sandi Klavžar, Mostafa Tavakoli, Mardjan Hakimi-Nezhaad, and Freydoon Rahbarnia. "Leap eccentric connectivity index in graphs with universal vertices." Applied Mathematics and Computation 436 (January 2023): 127519. http://dx.doi.org/10.1016/j.amc.2022.127519.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Weng, Weiming, and Bo Zhou. "On the eccentric connectivity index of uniform hypergraphs." Discrete Applied Mathematics 309 (March 2022): 180–93. http://dx.doi.org/10.1016/j.dam.2021.11.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Yarahmadi, Zahra, Sirous Moradi, and Tomislav Došlić. "Eccentric connectivity index of graphs with subdivided edges." Electronic Notes in Discrete Mathematics 45 (January 2014): 167–76. http://dx.doi.org/10.1016/j.endm.2013.11.031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Azari, Mahdieh, and Ali Iranmanesh. "Computing the eccentric-distance sum for graph operations." Discrete Applied Mathematics 161, no. 18 (2013): 2827–40. http://dx.doi.org/10.1016/j.dam.2013.06.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Jebreen, Kamel, Muhammad Haroon Aftab, M. I. Sowaity, B. Sharada, A. M. Naji, and M. Pavithra. "Eccentric Harmonic Index for the Cartesian Product of Graphs." Journal of Mathematics 2022 (December 19, 2022): 1–9. http://dx.doi.org/10.1155/2022/9219613.

Full text

Abstract:

Suppose ρ is a simple graph, then its eccentric harmonic index is defined as the sum of the terms 2 / e a + e b for the edges v a v b , where e a is the eccentricity of the a th vertex of the graph ρ . We symbolize the eccentric harmonic index (EHI) as H e = H e ρ . In this article, we determine H e for the Cartesian product (CP) of particularly chosen graphs. Lower bounds for H e of the CP of the two graphs are established. The formulas of EHI for the Hamming and Hypercube graphs are obtained. These obtained formulas can be used in QSAR and QSPR studies to get a better understanding of their

APA, Harvard, Vancouver, ISO, and other styles

34

Došlić, Tomislav, and Mahboubeh Saheli. "Augmented eccentric connectivity index." Miskolc Mathematical Notes 12, no. 2 (2011): 149. http://dx.doi.org/10.18514/mmn.2011.331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Smarandache, Florentin. "A Review of Mircea Eugen Şelariu’s Supermathematics: Bridging Centric and Eccentric Approaches (Vol. 1 and Vol. 2)." SciNexuses 2 (January 23, 2025): 12–21. https://doi.org/10.61356/j.scin.2025.2472.

Full text

Abstract:

This article provides a concise yet comprehensive review of the groundbreaking two-volume work, Supermathematics. Bases (2nd edition, 2012), authored by Professor Mircea Eugen Şelariu. By integrating centric and eccentric mathematics, Şelariu introduces a novel field of research with far-reaching applications. His pioneering approach stands as a singular contribution to the global scientific literature, expanding traditional mathematical boundaries and opening new possibilities for both theoretical inquiry and practical innovation.

APA, Harvard, Vancouver, ISO, and other styles

36

Reid, K. B., and Gu Weizhen. "Peripheral and eccentric vertices in graphs." Graphs and Combinatorics 8, no. 4 (1992): 361–75. http://dx.doi.org/10.1007/bf02351592.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Ma, Chuan, Xiaoyan Liu, Haiqian Zhao, and Guangfu Cui. "Influence of Vertical Downward Annulus Eccentricity on Steam-Water Two-Phase Flow Pressure Drop." Mathematical Problems in Engineering 2022 (April 7, 2022): 1–12. http://dx.doi.org/10.1155/2022/7682520.

Full text

Abstract:

Concentric dual-tubing steam injection technique is one of the main methods to improve heavy oil recovery efficiency. From field data, it was discovered that hot fluid at high temperature and pressure caused steam injection casing to have elongation strain and “necking” eccentric buckling, and the eccentricity change affected the accurate prediction of steam-water two-phase flow pressure drop in the steam injection casing. This paper established a coupling model for the steam-water two-phase flow pressure drop in vertical downward eccentric annulus and the wellbore heat transfer and developed

APA, Harvard, Vancouver, ISO, and other styles

38

Johnson, Iris DeLoach. "A Variation on “And the Winner Is …”." Mathematics Teaching in the Middle School 3, no. 2 (1997): 148–52. http://dx.doi.org/10.5951/mtms.3.2.0148.

Full text

Abstract:

Have you heard the one about an eccentric emperor who invites a number of guests to dinner, only to dump oatmeal onto the head of every other guest until only one remains dry? A variety of problems have solutions similar to the one for the problem posed by Harlos (1995). The version in our elementary-mathematics-methods textbook for preservice teachers (van de Walle 1994, 55) is called “The Emperor's Banquet Problem.”

APA, Harvard, Vancouver, ISO, and other styles

39

MEKHEIMER, KH S., Y. ABD ELMABOUD, and A. I. ABDELLATEEF. "PARTICULATE SUSPENSION FLOW INDUCED BY SINUSOIDAL PERISTALTIC WAVES THROUGH ECCENTRIC CYLINDERS: THREAD ANNULAR." International Journal of Biomathematics 06, no. 04 (2013): 1350026. http://dx.doi.org/10.1142/s1793524513500265.

Full text

Abstract:

This paper describes a new model for obtaining analytical solutions of peristaltic flow through eccentric annuli. A mathematical model of peristaltic pumping of a fluid mixture (as blood model) in a circular eccentric cylinders is presented and it is motivated due to the fact that thread injection is a promising method for placing medical implants within the human body with minimum surgical trauma. For the eccentric annuli, the inner cylinder is rigid and moving with a constant velocity V, and the outer one is hollow flexible cylinder that has a sinusoidal wave traveling down its wall. The cou

APA, Harvard, Vancouver, ISO, and other styles

40

Nikitin, N. V. "Direct numerical simulation of turbulent flows in eccentric pipes." Computational Mathematics and Mathematical Physics 46, no. 3 (2006): 489–504. http://dx.doi.org/10.1134/s0965542506030158.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Geng, Xianya, Shuchao Li, and Meng Zhang. "Extremal values on the eccentric distance sum of trees." Discrete Applied Mathematics 161, no. 16-17 (2013): 2427–39. http://dx.doi.org/10.1016/j.dam.2013.05.023.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Hua, Hongbo, Hongzhuan Wang, and Xiaolan Hu. "On eccentric distance sum and degree distance of graphs." Discrete Applied Mathematics 250 (December 2018): 262–75. http://dx.doi.org/10.1016/j.dam.2018.04.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Hauweele, Pierre, Alain Hertz, Hadrien Mélot, Bernard Ries, and Gauvain Devillez. "Maximum eccentric connectivity index for graphs with given diameter." Discrete Applied Mathematics 268 (September 2019): 102–11. http://dx.doi.org/10.1016/j.dam.2019.04.031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Vetrík, Tomáš, and Mesfin Masre. "General eccentric connectivity index of trees and unicyclic graphs." Discrete Applied Mathematics 284 (September 2020): 301–15. http://dx.doi.org/10.1016/j.dam.2020.03.051.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Hua, Hongbo, and Kinkar Chandra Das. "Comparative results and bounds for the eccentric-adjacency index." Discrete Applied Mathematics 285 (October 2020): 188–96. http://dx.doi.org/10.1016/j.dam.2020.05.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Ooms, G., and P. Poesio. "Analytical study of slightly eccentric core–annular flow." Journal of Engineering Mathematics 85, no. 1 (2013): 65–81. http://dx.doi.org/10.1007/s10665-013-9630-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Rayer, Clement Johnson, and Ravi Sankar Jeyaraj. "Applications on Topological Indices of Zero-Divisor Graph Associated with Commutative Rings." Symmetry 15, no. 2 (2023): 335. http://dx.doi.org/10.3390/sym15020335.

Full text

Abstract:

A topological index is a numeric quantity associated with a chemical structure that attempts to link the chemical structure to various physicochemical properties, chemical reactivity, or biological activity. Let R be a commutative ring with identity, and Z*(R) is the set of all non-zero zero divisors of R. Then, Γ(R) is said to be a zero-divisor graph if and only if a·b=0, where a,b∈V(Γ(R))=Z*(R) and (a,b)∈E(Γ(R)). We define a∼b if a·b=0 or a=b. Then, ∼ is always reflexive and symmetric, but ∼ is usually not transitive. Then, Γ(R) is a symmetric structure measured by the ∼ in commutative rings

APA, Harvard, Vancouver, ISO, and other styles

48

Vavrukh, M., D. Dzikovskyi, and O. Stelmakh. "Analytical images of Kepler's equation solutions and their applications." Mathematical Modeling and Computing 10, no. 2 (2023): 351–58. http://dx.doi.org/10.23939/mmc2023.02.351.

Full text

Abstract:

The simple fast-converging analytical calculations algorithms for eccentric anomaly are proposed for an arbitrary eccentricity 0<e≤1. The kinematic characteristics of Halley's comet are calculated as the function of time. Mass of Galaxy + NGC 224 system using the model of elliptical relative motion is also estimated.

APA, Harvard, Vancouver, ISO, and other styles

49

Yarahmadi, Zahra, Ali Reza Ashrafi, and Sirous Moradi. "Extremal values of augmented eccentric connectivity index of V-phenylenic nanotorus." Journal of Applied Mathematics and Computing 45, no. 1-2 (2013): 35–42. http://dx.doi.org/10.1007/s12190-013-0709-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Koam, Ali N. A., Ali Ahmad, and Azeem Haider. "On Eccentric Topological Indices Based on Edges of Zero Divisor Graphs." Symmetry 11, no. 7 (2019): 907. http://dx.doi.org/10.3390/sym11070907.

Full text

Abstract:

This article is devoted to the determination of edge-based eccentric topological indices of a zero divisor graph of some algebraic structures. In particular, we computed the first Zagreb eccentricity index, third Zagreb eccentricity index, geometric-arithmetic eccentricity index, atom-bond connectivity eccentricity index and a fourth type of eccentric harmonic index for zero divisor graphs associated with a class of finite commutative rings.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!