Extended Adjacency Matrix Research Articles

Bounds of the extended Estrada index of graphs

Let G be a graph on n vertices and η1,η2,…,ηn the eigenvalues of its extended adjacency matrix. The extended Estrada index EEex is defined as the sum of the terms eηi,i=1,2,…,n. In this paper we establish lower and upper bounds for EEex in terms of the number of vertices and the number of edges and characterize the extremal graphs. Also the bounds for EEex of some special graphs are obtained.

Graph-theoretical evaluation of the inelastic propensity rules for molecules with destructive quantum interference.

We present a method based on graph theory for the evaluation of the inelastic propensity rules for molecules exhibiting complete destructive quantum interference in their elastic transmission. The method uses an extended adjacency matrix corresponding to the structural graph of the molecule for calculating Green's function between the sites with attached electrodes and consequently states the corresponding conditions the electron-vibration coupling matrix must meet for the observation of an inelastic signal between the terminals. The method can be fully automated and we provide a functional website running a code using Wolfram Mathematica, which returns a graphical depiction of destructive quantum interference configurations together with the associated inelastic propensity rules for a wide class of molecules.

On spectral radius and energy of extended adjacency matrix of graphs

Let G be a graph of order n. For i=1,2,…,n, let di be the degree of the vertex vi of G. The extended adjacency matrix Aex of G is defined so that its (i, j)-entry is equal to 12(didj+djdi) if the vertices vi and vj are adjacent, and 0 otherwise,Yang et al. (1994). The spectral radius η1 and the energy Eex of the Aex-matrix are examined. Lower and upper bounds on η1 and Eex are obtained, and the respective extremal graphs characterized.

Assur-Group Inferred Structural Synthesis for Planar Mechanisms

In order to obtain a comprehensive list of possible mechanisms with various choices of both R and P pairs and mechanism inversion of planar mechanisms, a new structural synthesis method is developed by integrating Assur groups (AGs) as elements in the newly developed group-based adjacency matrix. This extended adjacency matrix is proposed with the diagonal elements representing three fundamental elements as the frame link, driving link, AG and augmented AG (AAG) if metamorphic mechanisms are to be synthesized. The off-diagonal elements provide information on group combination and connection forms of the above three fundamental elements and that on the associated kinematic pairs. Based on the extended adjacency matrix, all assembly modes for the given AGs can be established and isomorphism mechanisms can be identified at the same time. Considering all types of the AGs in the extended adjacency matrix, group permutation and combination are used and connection forms are generated including variation of the driving link and mechanism inversion. The structural synthesis is then extending to generating a comprehensive list of types of mechanisms and illustrated by the synthesis for class II 6-bar planar mechanisms with both R and P pairs, generating a list of 588 types of mechanisms that are derived for the first time. The paper further applies the approach to metamorphic mechanisms, and obtained five connection forms of the 7-bar 2DOF metamorphic mechanisms.

Novel Method for Measuring Structure and Semantic Similarity of XML Documents Based on Extended Adjacency Matrix

Similarity measurement of XML documents is crucial to meet various needs of approximate searches and document classifications in XML-oriented applications. Some methods have been proposed for this purpose. Nevertheless, few methods can be elegantly exploited to depict structure and semantic information and hence to effectively measure the similarity of XML documents. In this paper, we present a new method of computing the structure and semantic similarity of XML documents based on extended adjacency matrix(EAM). Different from a general adjacency matrix, in an EAM, the structure information of not only the adjacent layers but also the ancestor-descendant layers can be stored. For measuring the similarity of two XML documents, the proposed method firstly stores the structure and semantic information in two extended adjacency matrices(M1, M2). Then it computes similarity of the two documents through cos(M1, M2) Experimental results on bench-mark data show that the method holds high efficiency and accuracy.

Configuration Analysis of Metamorphic Mechanisms Based on Extended Adjacency Matrix Operations

The adjacency matrix operations,which connect with configuration transformation correspondingly,can be used for analysis of configuration transformation of metamorphic mechanisms and the corresponding algorithm can easily be simulated by computer.But the adjacency matrix based on monochrome topological graph is not suitable for the topological representation of mechanisms with multiple joints.The method of adjacency matrix operations has its own limitations for analysis of configuration transformation of metamorphic mechanisms because it can only be used in the topological representation of mechanisms with single joints.In order to overcome the drawback of the adjacency matrix,a kind of new matrix named as extended adjacency matrix is proposed to express topological structures of all mechanisms.The extended adjacency matrix is not only suitable for the topological representation of mechanisms with single joints,but also can be used in that of mechanisms with multiple joints.On this basis,a method of matrix operations based on the extended adjacency matrix is proposed to analyze the configuration transformation of metamorphic mechanisms.The method is not only suitable for configuration analysis of metamorphic mechanisms with single joints as well as metamorphic mechanisms with multiple joints.The method is evaluated by calculating two examples representing metamorphic mechanisms with single joint and multiple joints respectively.It can be concluded that the method is effective and correct for analysis of configuration transformation of all metamorphic mechanisms.The proposed method is simple and easy to be achieved by computer programming.It provides a basis for structural synthesis of all metamorphic mechanisms.

Dynamics in scheduled networks

When studying real or virtual systems through complex networks theories, usually time restrictions are neglected, and a static structure is defined to characterize which node is connected to which other. However, this approach is oversimplified, as real networks are indeed dynamically modified by external mechanisms. In order to bridge the gap, in this work we present a scheduled network formalism, which takes into account such dynamical modifications by including generic time restrictions in the structure of an extended adjacency matrix. We present some of its properties and apply this formalism to the specific case of the air transportation network in order to analyze its efficiency. Real data are used at this point. We finally discuss on the applicability of this formalism to other complex systems.

Identification of kinematic chains and distinct mechanisms using extended adjacency matrix

Development of the methods for generating distinct mechanisms derived from a given family of kinematic chains has been persued by a number of researchers in the past, as the distinct kinematic structures provide distinct performance characteristics. A new method is proposed to identify the distinct mechanisms derived from a given kinematic chain in this paper. Kinematic chains and their derived mechanisms are represented in the form of an extended adjacency matrix [EA] using the graph theoretic approach. Two structural invariants derived from the eigen spectrum of the [EA] matrix are the sum of absolute eigen values EA∑ and maximum absolute eigen value EAmax. These invariants are used as the composite identification number of a kinematic chain and mechanism and are tested to identify the all-distinct mechanisms derived from the family of 1-F kinematic chains up to 10 links. The identification of distinct kinematic chains and their mechanisms is necessary to select the best possible mechanism for the specified task at the conceptual stage of design.

On Highly Discriminating Molecular Topological Index

A highly discriminating molecular topological index, EAID, is proposed based on the extended adjacency matrix. A systematic search for degeneracy was performed for 3 807 434 alkane trees, 202 558 complex cyclic or polycyclic graphs, and 430 472 structures containing heteroatoms. No counterexamples (two or more nonisomorphic structures with the same EAID number) were found. This is a hitherto unheard of power of discrimination. Thus EAID might be possibly used as supplementary reference for CAS Registry Numbers for structure documentation.

Extended Adjacency Matrix Indices and Their Applications

In this paper, new topological indices, EA Sigma and EAmax, are introduced. They are based on the extended adjacency matrices of molecules, in which the influences of factors of heteroatoms and multiple bonds were considered. The results show that EA Sigm