Lkhagva Buyantogtokh

Dr. Lkhagva Buyantogtokh

Mongolian National University of Education, Ulaanbaatar, Mongolia
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2020 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
LBLkhagva Buyantogtokh
Lkhagva Buyantogtokh
BHBatmend Horoldagva
Batmend Horoldagva
Kinkar Chandra DasKinkar Chandra Das
Kinkar Chandra Das

31 March 2023 in Mediterranean Journal of Mathematics
Verified
Journal Article
Closed access
PDF file
CXChunlei Xu
Chunlei Xu
BHBatmend Horoldagva
Batmend Horoldagva
LBLkhagva Buyantogtokh
Lkhagva Buyantogtokh

25 July 2022 in Computational and Applied Mathematics
Verified
Journal Article
Closed access
PDF file
SDShiikhar Dorjsembe
Shiikhar Dorjsembe
LBLkhagva Buyantogtokh
Lkhagva Buyantogtokh
Kinkar Chandra DasKinkar Chandra Das
Kinkar Chandra Das
BHBatmend Horoldagva
Batmend Horoldagva

29 September 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
LBLkhagva Buyantogtokh
Lkhagva Buyantogtokh
BHBatmend Horoldagva
Batmend Horoldagva
Kinkar Chandra DasKinkar Chandra Das
Kinkar Chandra Das
Graph-based molecular structure descriptors (often called “topological indices”) are useful for modeling the physical and chemical properties of molecules, designing pharmacologically active compounds, detecting environmentally hazardous substances, etc. The graph invariant GRMα, known under the name general reduced second Zagreb index, is defined as GRMα(Γ)=∑uv∈E(Γ)(dΓ(u)+α)(dΓ(v)+α), where dΓ(v) is the degree of the vertex v of the graph Γ and α is any real number. In this paper, among all trees of order n, and all unicyclic graphs of order n with girth g, we characterize the extremal graphs with respect to GRMα(α≥−12). Using the extremal unicyclic graphs, we obtain a lower bound on GRMα(Γ) of graphs in terms of order n with k cut edges, and completely determine the corresponding extremal graphs. Moreover, we obtain several upper bounds on GRMα of different classes of graphs in terms of order n, size m, independence number γ, chromatic number k, etc. In particular, we present an upper bound on GRMα of connected triangle-free graph of order n>2, m>0 edges with α>−1.5, and characterize the extremal graphs. Finally, we prove that the Turán graph Tn(k) gives the maximum GRMα(α≥−1) among all graphs of order n with chromatic number k.

1 October 2021 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
BHBatmend Horoldagva
Batmend Horoldagva
LBLkhagva Buyantogtokh
Lkhagva Buyantogtokh
SDShiikhar Dorjsembe
Shiikhar Dorjsembe
EAEnkhbayar Azjargal
Enkhbayar Azjargal
DADamchaa Adiyanyam
Damchaa Adiyanyam

20 May 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
CXChunlei Xu
Chunlei Xu
BHBatmend Horoldagva
Batmend Horoldagva
LBLkhagva Buyantogtokh
Lkhagva Buyantogtokh
A connected graph G is said to be a cactus if any two cycles have at most one vertex in common. The multiplicative sum Zagreb index of a graph G is the product of the sum of the degrees of adjacent vertices in G. In this paper, we introduce several graph transformations that are useful tools for the study of the extremal properties of the multiplicative sum Zagreb index. Using these transformations and symmetric structural representations of some cactus graphs, we determine the graphs having maximal multiplicative sum Zagreb index for cactus graphs with the prescribed number of pendant vertices (cut edges). Furthermore, the graphs with maximal multiplicative sum Zagreb index are characterized among all cactus graphs of the given order.