Chinese Science Bulletin

An i-clique in G is a subset of V(G) which induces a complete subgraph of G of order i. In this paper, we examined the cardinality of the neighborhood systems of these cliques in a graph. Moreover, we established the clique neighborhood polynomial of the graph resulting from the join of two connected graphs.

Zea Mays L (madurese corn) cultivation is highly encouraged for farmer in Indonesia, especially in the East Java area. This is because the demand for corn in Indonesia is still very high. It is hoped that Indonesia can meet the needs of this corn to reduce exports from other countries. The use of technology in agriculture has been widely applied but unfortunately the application for corn farming is still lacking. One of the technologies is IoT-based smart farming, but the application of smart farming is still being implemented for all types of plants. Whereas the real condition of each plant h

The aim of the study is to develop and determine the effectiveness of a device for shaking off the Colorado potato beetle (Leptinotarsa decemlineata Say) and its larvae from potato bushes. Theoretical studies include the analysis of the effect of transverse force on the potential strain energy of various types of elastic rods: nylon, fibreglass, organoplastic and carbon fibre. Experimental studies were carried out using elastic rods of circular shape with a diameter of 10 mm and different lengths of 200, 250 and 300 mm. The influence of the ratio of elastic moduli and the ratio of length to di

An innovative extraction method, incorporating simultaneous ultrasonic, enzymatic, and two-phase aqueous extraction, was employed to enhance the ethanol extract of phenolics and flavonoids from Strobilanthes crispus leaves. The study investigated the correlation between extraction method parameters and the total phenolic content (TPC), total flavonoids content (TFC), partition coefficient (k), and recovery (R) of the ethanol extract from leaves. The cellulase enzyme from Aspergillus niger was utilized, and a two-phase solvent system (ethanol-ammonium sulfate, 33:14 %w/w) was employed. Isolatio

Let G be a simple graph. A subset U of E(G) is an edge cover of G if every vertex in G is incident with an edge in U. The minimum cardinality of an edge cover of G is called the edge covering number of G. In this paper, we established an upper bound for the edge covering number of graphs resulting from the corona of two connected graphs in terms of the edge covering numbers of the graphs in consideration.