نتایج جستجو برای: graph theoretical descriptor
تعداد نتایج: 493699 فیلتر نتایج به سال:
In this paper, we propose a highly robust point-matching method (Graph Transformation Matching GTM) relying on finding the consensus graph emerging from putative matches. Such method is a twophased one in the sense that after finding the consensus graph it tries to complete it as much as possible. We successfully apply GTM to image registration in the context of finding mosaics from retinal ima...
altan derivatives of polycyclic conjugated hydrocarbons were recently introduced and studied in theoretical organic chemistry. we now provide a generalization of the altan concept, applicable to any graph. several earlier noticed topological properties of altan derivatives of polycyclic conjugated hydrocarbons are shown to be the properties of all altan derivatives of all graphs. among these ar...
in this article a graph theoretical approach is employed to study some specifications of dynamic systems with time delay in the inputs and states, such as structural controllability and observability. first, the zero and non-zero parameters of a proposed system have been determined, next the general structure of the system is presented by a graph which is constructed by non-zero parameters. the...
The structure uncertain non-linear descriptor systems have been considered. A controller feedback and open loop stabilization of non-linear perturbed descriptor system have been developed using Lyapunov function approach and finite time stability principle. The theoretical justifications with the necessary requirements and illustration have also been presented.
Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g and [y,x] g. We denote this graph by . In this paper, we present some graph theoretical properties of g-noncommuting graph. Specially, we investigate about its planarity and regularity, its clique number a...
In theoretical chemistry, -modified Wiener index is a graph invariant topological index to analyze the chemical properties of molecular structure. In this note, we determine the minimum -modified Wiener index of graph with fixed connectivity or edge-connectivity. Our results also present the sufficient and necessary condition for reaching the lower bound.
If we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity.In this paper we discuss...
Introduction: Graph theoretical analysis of functional Magnetic Resonance Imaging (fMRI) data has provided new measures of mapping human brain in vivo. Of all methods to measure the functional connectivity between regions, Linear Correlation (LC) calculation of activity time series of the brain regions as a linear measure is considered the most ubiquitous one. The strength of the dependence obl...
the narumi-katayama index was the first topological index defined by the product of some graph theoretical quantities. let $g$ be a simple graph with vertex set $v = {v_1,ldots, v_n }$ and $d(v)$ be the degree of vertex $v$ in the graph $g$. the narumi-katayama index is defined as $nk(g) = prod_{vin v}d(v)$. in this paper, the narumi-katayama index is generalized using a $n$-ve...
Depth scans acquired from different views may contain nuisances such as noise, occlusion, and varying point density. We propose a novel Signature of Geometric Centroids descriptor, supporting direct shape matching on the scans, without requiring any preprocessing such as scan denoising or converting into a mesh. First, we construct the descriptor by voxelizing the local shape within a uniquely ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید