This study provided a content analysis of studies aiming to disclose how artificial intelligence (AI) has been applied to the education sector and explore the potential research trends and challenges of AI in education. A total of 100 papers including 63 empirical papers (74 studies) and 37 analytic papers were selected from the education and educational research category of Social Sciences Citation Index database from 2010 to 2020. The content analysis showed that the research questions could be classified into development layer (classification, matching, recommendation, and deep learning), application layer (feedback, reasoning, and adaptive learning), and integration layer (affection computing, role-playing, immersive learning, and gamification). Moreover, four research trends, including Internet of Things, swarm intelligence, deep learning, and neuroscience, as well as an assessment of AI in education, were suggested for further investigation. However, we also proposed the challenges in education may be caused by AI with regard to inappropriate use of AI techniques, changing roles of teachers and students, as well as social and ethical issues. The results provide insights into an overview of the AI used for education domain, which helps to strengthen the theoretical foundation of AI in education and provides a promising channel for educators and AI engineers to carry out further collaborative research.

No abstract

No abstract

The incidence energy I E (G) of a graph G, defined as the sum of the singular values of the incidence matrix of a graph G, is a much studied quantity with well known applications in chemical physics. The Laplacian-energy-like invariant of G is defined as the sum of square roots of the Laplacian eigenvalues. In this paper, we obtain the closed-form formulae expressing the incidence energy and the Laplacian-energy-like invariant of the Union Jack lattice. Moreover, the explicit asymptotic values of these quantities are calculated by utilizing the applications of analysis approach with the help of calculational software.

The computational complexity of the Hosoya index of a given graph is NP-Complete. Let [Formula: see text] be the graph constructed from [Formula: see text] by a triangle instead of all vertices of the initial graph [Formula: see text]. In this paper, we characterize the Hosoya index of the graph [Formula: see text]. To our surprise, it shows that the Hosoya index of [Formula: see text] is thoroughly given by the order and degrees of all the vertices of the initial graph [Formula: see text].