Submission Deadline ( Vol 70 , Issue 10 )
16 Oct 2025Publish On ( Vol 70 , Issue 10 )
31 Oct 2025Chinese Science Bulletin (ISSN:0023-074X) and (E-ISSN:2095-9419) is a monthly peer-reviewed scopus indexed journal originally from 1963 to 1964, from 1980 to 1984, 1989, from 2015 to Present. The publisher of the journal is Editorial Office of Journal of Science China Press.The journal welcomes all kind of research/review/abstract papers regarding Multidisciplinary subjects.
AIM AND SCOPE
1.Agricultural Science/Agricultural Engineering
2.Electrical Engineering and Telecommunication Section
3.Computer Science and Engineering
4.Civil and Architectural Engineering Section
5.Mechanical and Materials Engineering Section
6.Chemical Engineering Section
7.Food Engineering Section
8.Physics Section
9.Mathematics Section
10.Accounting and finance
11.Economics
12.Management
13.Social science
14.Earth science
15.Law
16.Linguistics
17.Biological science
18.Environmental science
19.Material science
20.zoology
21.Fishery and Science
22.Psychology
23.International Business
24.HRM
25.Marketing
26.History
27.Public health
28.Botany
ALL PUBLISH JOURNAL HERE
CSB-27-02-2024-1226
/
Chinese Science Bulletin
We applied fractal analysis to the mathematical determination of fractal dimensions to unambiguously define the neodymium magnesium titanium oxide structure. Its microstructure, space group, and crystal structure were determined and are directly connected to its microwave frequency electrical properties, which are important for the miniaturisation of electronic components. We performed a fractal analysis of the microstructure of neodymium magnesium titanium oxide Nd(Mg1/2Ti1/2)O3 (NMT) to determine the microstructure. Its appearance, area, and angle computations are comparable to those of the
CSB-26-02-2024-1224
/
Chinese Science Bulletin
For a graph G with vertex set V(G), an ordered subset W={w_1,w_2,...,w_k} of V(G), the k-vector (d(v,w_1),d(v,w_2),...,d(v,w_k)) is called the resolving vector of v∈V(G) with respect to W denoted by r(v|W). The set W is called a resolving set of graph G if r(u|W)≠r(v|W) for any two distinct vertices u and v. A subset D of V(G) is called a resolving dominating set if it is resolving as well as dominating and it is called equitable if for every vertex v∈V(G)-D, there exists a vertex u∈D such that uv∈E(G) and |deg(u)-deg(v)|≤1. A dominating set which is both equitable and resolving is
CSB-24-02-2024-1220
/
Chinese Science Bulletin
In this paper, we introduced the concept of edge geodetic closure polynomial of a graph and established results for complete graphs, paths and complete bipartite graphs. Interestingly, we have shown that the edge geodetic closure polynomial of a path can be expressed as a combination of a polynomial and its derivative.
CSB-24-02-2024-1219
/
Chinese Science Bulletin
In this paper, we established some properties of restrained locating total dominating sets in graphs. Moreover, we characterized graphs with restrained locating total domination number equal to 2 and those graphs with restrained locating total domination number equal to its order.
CSB-24-02-2024-1218
/
Chinese Science Bulletin
In this paper, we extended the work of [2] in topological spaces by introducing generalized star closed and open sets. This article employed exploratory research design which involves data mining of existing concepts on GTS to understand patterns and trends on characteristics of sets and functions. Further, in-depth analysis was conducted to explore related concepts and to characterize sets in GTS. This article mainly contributes to the establishment of topological properties of the newly introduced sets in GTS. While the implications of this study are limited to the academic community studyin