Search

The aims of this analysis are to explain the level of thinking of grade VIII students at SMP Negeri 1 Talang Ubi in solving Pythagorean Theorem questions based on Van Hiele's theory. The research approach used in this analysis is descriptive qualitative case study research. The subjects of this research were three students of grade VIII of SMP Negeri 1 Talang Ubi, South Sumatera Indonesia. The three students were chosen based on their test answers on the Pythagorean Theorem material, with one being a high-ability student, one being a medium-ability student, and one being a low-ability student. The study's data collection techniques included assessments, interviews, and documentation. Techniques for data processing include data reduction, data presentation, and conclusion. The findings revealed that high-ability students could complete all four stages of Van Hiele's thinking: imagination, interpretation, informal deduction, and deduction. Moderate students achieved three levels of Van Hiele's thinking, including visualization, analysis, and informal deduction, while low-ability students achieved only one level of Van Hiele's thinking, visualization.

Graph theory has applications in various fields due to offering important tools such as topological indices. Among the topological indices, the Randić index is simple and of great importance. The Randić index of a graph 𝒢 can be expressed as R(G)=∑xy∈Y(G)1τ(x)τ(y)R\left( G \right) = \sum\nolimits_{xy \in Y\left( G \right)} {{1 \over {\sqrt {\tau \left( x \right)\tau \left( y \right)} }}}, where 𝒴(𝒢) represents the edge set and τ(x) is the degree of vertex x. In this paper, considering the importance of the Randić index and applications two-trees graphs, we determine the first two minimums among the two-trees graphs.

The prevalent approach to motif analysis seeks to describe the local connectivity structure of networks by identifying subgraph patterns that appear significantly more often in a network then expected under a null model that conserves certain features of the original network. In this article we advocate for an alternative approach based on statistical inference of generative models where nodes are connected not only by edges but also copies of higher order subgraphs. These models naturally lead to the consideration of latent states that correspond to decompositions of networks into higher order interactions in the form of subgraphs that can have the topology of any simply connected motif. Being based on principles of parsimony the method can infer concise sets of motifs from within thousands of candidates allowing for consistent detection of larger motifs. The inferential approach yields not only a set of statistically significant higher order motifs but also an explicit decomposition of the network into these motifs, which opens new possibilities for the systematic study of the topological and dynamical implications of higher order connectivity structures in networks. After briefly reviewing core concepts and methods, we provide example applications to empirical data sets and discuss how the inferential approach addresses current problems in motif analysis and explore how concepts and methods common to motif analysis translate to the inferential framework. [ABSTRACT FROM AUTHOR]

Topological indices are mathematical descriptors of the structure of a molecule that can be used to predict its properties. They are derived from the graph theory, which describes the topology of a molecule and its connectivity. The main objective is mathematical modeling and topological properties of Y-graphyne. Current research focuses on two structures made from hexagonal honeycomb graphite lattices named triangular Y-graphyne and triangular Y-graphyne chains. The authors have simultaneously computed the first and second Reverse Zagreb indices, reverse hyper-Zagreb indices, and their polynomials. This research also derives mathematical closed-form formulas for some of its fundamental degree-based molecular descriptors. Researchers have been trying to synthesize a novel carbon form called Graphyne. For over a decade but with no success. Recently, some researchers have made a breakthrough in generating Carbons elusive allotrope and solved a long-standing problem in carbon materials. This wonder material is created to rival the conductivity of graphene but with control. These results opened new ways of research in the fields of semiconductors, electronics and optics. Furthermore, graphical and tabular results will help to investigate the structure-property relationships in γ-graphyne. [ABSTRACT FROM AUTHOR]

In the paper, we introduce the signless Laplacian A B C -matrix Q ̃ (G) = D ¯ (G) + A ̃ (G) , where D ¯ (G) is the diagonal matrix of A B C -degrees and A ̃ (G) is the A B C -matrix of G. The eigenvalues of the matrix Q ̃ (G) are the signless Laplacian A B C -eigenvalues of G. We give some basic properties of the matrix Q ̃ (G) , which includes relating independence number and clique number with signless Laplacian A B C -eigenvalues. For bipartite graphs, we show that the signless Laplacian A B C -spectrum and the Laplacian A B C -spectrum are the same. We characterize the graphs with exactly two distinct signless Laplacian A B C -eigenvalues. Also, we consider the problem of the characterization of the graphs with exactly three distinct signless Laplacian A B C -eigenvalues and solve it for bipartite graphs and, in some cases, for non-bipartite graphs. We also introduce the concept of the trace norm of the matrix Q ̃ (G) − t r (Q ̃ (G)) n I , called the signless Laplacian A B C -energy of G. We obtain some upper and lower bounds for signless Laplacian A B C -energy and characterize the extremal graphs attaining it. Further, for graphs of order at most 6, we compare the signless Laplacian energy and the A B C -energy with the signless Laplacian A B C -energy and found that the latter behaves well, as there is a single pair of graphs with the same signless Laplacian A B C -energy unlike the 26 pairs of graphs with same signless Laplacian energy and eight pairs of graphs with the same A B C -energy. [ABSTRACT FROM AUTHOR]

Let S(Γ) be a Seidel matrix of a graph Γ of order n and let D(Γ) = diag(n − 1 − 2d1, n − 1 − 2d2, ..., n − 1 − 2dn) be a diagonal matrix with di denoting the degree of a vertex vi in Γ. The Seidel Laplacian matrix of Γ is defined as SL(Γ) = D(Γ) − S(Γ). In this paper, we obtain an upper bound, and a lower bound on the Seidel Laplacian Estrada index of graphs. Moreover, we find a relation between Seidel energy and Seidel Laplacian energy of graphs. We establish some lower bounds on the Seidel Laplacian energy in terms of different graph parameters. Finally, we present a relation between Seidel Laplacian Estrada index and Seidel Laplacian energy of graphs. [ABSTRACT FROM AUTHOR]

Mycobacterium tuberculosis is an organism that causes tuberculosis (TB), a common infectious disease that has a high death and morbidity rate. Topological indices are mathematical tools used to describe the structural properties of molecules or networks. They provide a quantitative measure of the connectivity and complexity of a system, and play a crucial role in numerous area such as biochemistry and bioinformatics. The purpose of topological indices is to simplify complex structures into numerical values that can be easily analyzed and compared. QSPR modeling is a technique in chemistry that relates the structure of a chemical compound to its physical or chemical properties. It is used to predict properties like boiling points, solubilities, toxicities, and even biological activities of compounds. This saves time, resources, and enables researchers to make informed decisions in drug discovery, material science, and many other areas. In this study, we conducted an analysis of several drugs used for the treatment of tuberculosis. We focused on computing the reducible topological indices based on their degrees. Several techniques and approaches are employed. To perform calculations, we used edge partition methodology, analytical techniques, theoretical graph utilities, and degree counting method. Additionally, we examined six physicochemical properties of these drugs. To establish quantitative structure-property relationship models and evaluate their effectiveness, we employed linear, quadratic, and logarithmic regression analysis. By analyzing the reducible topological indices and physicochemical properties, we aimed to gain a deeper understanding of the drugs' characteristics and their potential impact on tuberculosis treatment. This study established a significant relationship between the defined indices with two key properties: molar mass and collision cross section. The correlation coefficients for molar mass range from 0.7 to 0.9, while the collision cross section range from 0.8 to 0.9. These results demonstrate a strong association between the indices and the properties under investigation. Furthermore, it is worth noting that both molar mass and collision cross section satisfy the requirements for p-value and F-test value across all indices. This indicates the statistical significance of the observed correlations and the reliability of our findings. [ABSTRACT FROM AUTHOR]

Previous studies on the co-evolving between vaccination strategies and epidemics mainly assumed that the vaccination strategies were made in the period between two spreading seasons. However, individual cognition during the spreading seasons might also alter the vaccination strategy and inversely influence the epidemic spreading. We propose a coupled disease-behavior model to describe the dynamic evolution of vaccination behavior during the spread of infectious diseases. The model integrates a susceptible-infected-vaccinated (SIV) model with the diffusion of vaccination behavior. We focus on the trade-off between perceptions of infection risk and the vaccination behaviors of neighbors, characterizing individual vaccination opinions. We introduce an opinion-critical value to map vaccination opinions into vaccination behavior. The vaccination coverage of the disease-behavior model is studied in network models and real-world networks. In addition, when societal costs are measured based on the degree of initial vaccinees, the cost of randomly selecting initial vaccinees is lowerthan selecting individuals with high or low degrees as vaccinees. Evaluating an individual's ability to transmit vaccination behavior based on the neighbor's number is inappropriate. We find that the impact of effective spreading rates on group vaccination is not one-sided and that reducing fear and highlighting the dangers of infectious diseases are crucial to increasing vaccination coverage. [ABSTRACT FROM AUTHOR]

Cubic fuzzy graphs (CFGs) offer greater utility as compared to interval-valued fuzzy graphs and fuzzy graphs due to their ability to represent the degree of membership for vertices and edges using both interval and fuzzy number forms. The significance of these concepts motivates us to analyze and interpret intricate networks, enabling more effective decision making and optimization in various domains, including transportation, social networks, trade networks, and communication systems. This paper introduces the concepts of vertex and edge connectivity in CFGs, along with discussions on partial cubic fuzzy cut nodes and partial cubic fuzzy edge cuts, and presents several related results with the help of some examples to enhance understanding. In addition, this paper introduces the idea of partial cubic α-strong and partial cubic δ-weak edges. An example is discussed to explain the motivation behind partial cubic α-strong edges. Moreover, it delves into the introduction of generalized vertex and edge connectivity in CFGs, along with generalized partial cubic fuzzy cut nodes and generalized partial cubic fuzzy edge cuts. Relevant results pertaining to these concepts are also discussed. As an application, the concept of generalized partial cubic fuzzy edge cuts is applied to identify regions that are most affected by trade deficits resulting from street crimes. Finally, the research findings are compared with the existing method to demonstrate their suitability and creativity. [ABSTRACT FROM AUTHOR]

This paper investigates the problem of resilient vector consensus for a group of dynamic agents against mobile malicious attacks. As real networks often operate under random environment and noises, we approach this problem by considering general random dynamic networks with weighted directed topologies. We propose three types of mobile attack models, which differ in the timing of moving of attackers and the capability of detecting such moving. By employing distributed discrete-time algorithms, the Lyapunov theory and martingale convergence theorem, resilient vector consensus is shown to be reached for all three models when the underlying network satisfies certain stochastic robustness conditions. [ABSTRACT FROM AUTHOR]

In this article, we discuss the spectral properties of the general extended adjacency matrix for chain graphs. In particular, we discuss the eigenvalues of the general extended adjacency matrix of the chain graphs and obtain its general extended adjacency inertia. We obtain bounds for the largest and the smallest general extended adjacency eigenvalues and characterize the extremal graphs. We also obtain a lower bound for the spread of the general extended adjacency matrix. We characterize chain graphs with all the general extended adjacency eigenvalues being simple and chain graphs that are non-singular under the general extended adjacency matrix. Further, we determine the explicit formula for the determinant and the trace of the square of the general extended adjacency matrix of chain graphs. Finally, we discuss the energy of the general extended adjacency matrix and obtain some bounds for it. We characterize the extremal chain graphs attaining these bounds. [ABSTRACT FROM AUTHOR]

In this paper we develop a dynamical information diffusion model which features the affinity of people with information disseminated in social networks. Four types of agents, i.e., susceptible, informed, known, and refractory ones, are involved in the system, and the affinity mechanism composing of an affinity threshold which represents the fitness of information to be propagated is incorporated. The model can be generally described by a time-inhomogeneous Markov chain, which is governed by its master (Kolmogorov) equation. Based on the Wei-Norman method, we derive analytical solutions of the model by constructing a low-dimensional Lie algebra. Numerical examples are provided to illustrate the obtained theoretical results. This study provides useful insights into the closed-form solutions of complex social dynamics models through the Lie algebra method.

This paper studies the matrix-scaled resilient consensus problems over multi-agent networks as occurring in computer science and distributed control. Unlike existing works on consensus problems, where the states of agents converge to a common value or reach some prescribed proportions, we take a more general matrix-scaled approach to accommodate the interdependence of multi-dimensional states. We develop a unified analytical framework to deal with matrix-scaled resilient consensus of discrete-time and continuous-time dynamical agents, where the underlying communication network is modeled as a generic directed time-dependent random graph. We propose new distributed protocols to guarantee the matrix-scaled consensus of cooperative agents in the network in the presence of Byzantine agents, who have full knowledge of the system and pose a severe security threat to the collective consensus objective. The cooperative agents feature multiple input and multiple output, and the number and identities of Byzantine agents are not available to the cooperative ones. Our mathematical approach capitalizes on matrix analysis, control theory, graph theory, and martingale convergence. Some numerical examples are presented to demonstrate the effectiveness of our theoretical results. [ABSTRACT FROM AUTHOR]

This paper initiates the study of the mathematical aspects of the ad-hoc Lanzhou index. If G is a graph with the vertex set { x 1 , ... , x n } , then the ad-hoc Lanzhou index of G is defined by L z ˜ (G) = ∑ i = 1 n d i (n − 1 − d i) 2 , where d i represents the degree of the vertex x i . Several identities for the ad-hoc Lanzhou index, involving some existing topological indices, are established. The problems of finding graphs with the extremum values of the ad-hoc Lanzhou index from the following sets of graphs are also attacked: (i) the set of all connected ξ -cyclic graphs of a fixed order, (ii) the set of all connected molecular ξ -cyclic graphs of a fixed order, (iii) the set of all graphs of a fixed order, and (iv) the set of all connected molecular graphs of a fixed order. [ABSTRACT FROM AUTHOR]

The field of mathematics that studies the relationship between algebraic structures and graphs is known as algebraic graph theory. It incorporates concepts from graph theory, which examines the characteristics and topology of graphs, with those from abstract algebra, which deals with algebraic structures such as groups, rings, and fields. If the vertex set of a graph G ^ is fully made up of the zero divisors of the modular ring Z n , the graph is said to be a zero-divisor graph. If the products of two vertices are equal to zero under (modn), they are regarded as neighbors. Entropy, a notion taken from information theory and used in graph theory, measures the degree of uncertainty or unpredictability associated with a graph or its constituent elements. Entropy measurements may be used to calculate the structural complexity and information complexity of graphs. The first, second and second modified Zagrebs, general and inverse general Randics, third and fifth symmetric divisions, harmonic and inverse sum indices, and forgotten topological indices are a few topological indices that are examined in this article for particular families of zero-divisor graphs. A numerical and graphical comparison of computed topological indices over a proposed structure has been studied. Furthermore, different kinds of entropies, such as the first, second, and third redefined Zagreb, are also investigated for a number of families of zero-divisor graphs. [ABSTRACT FROM AUTHOR]

The study of the maximum and minimal characteristics of graphs is the focus of the significant field of mathematics known as extreme graph theory. Finding the biggest or smallest graphs that meet specified criteria is the main goal of this discipline. There are several applications of extremal graph theory in various fields, including computer science, physics, and chemistry. Some of the important applications include: Computer networking, social networking, chemistry and physics as well. Recently, in 2021 exponential multiplicative Zagreb indices were introduced. In generalization, we introduce the generalized form of exponential multiplicative Zagreb indices for α ∈ R + \ { 1 }. Furthermore, to see the behaviour of generalized first and second exponential Zagreb indices for α ∈ R + \ { 1 } , we used a transformation method. In term of the two newly developed generalized exponential multiplicative Zagreb indices, we will investigate the extremal bicyclic, uni-cyclic and trees graphs. Four graph transformations are used and some bounds are presented in terms of generalized exponential multiplicative Zagreb indices. [ABSTRACT FROM AUTHOR]

As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connected graph G is defined to be the line graph of the barycentric subdivision of G. In this paper we obtain a closed-form formula for the enumeration of spanning trees in Г(G), employing the theory of electrical networks. We present bounds for the largest and second smallest Laplacian eigenvalues of Г(G) in terms of the maximum degree, the number of edges, and the first Zagreb index of G. In addition, we establish upper and lower bounds for the Laplacian Estrada index of Г(G) based on the vertex degrees of G. These bounds are also connected with the number of spanning trees in Г(G).