P-Path Minimum Distance Connectivity from Head Quarter to the Cities
نویسندگان
چکیده
منابع مشابه
from linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar
chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...
15 صفحه اولQuarter Boundary in Historical Fabrics of Iranian Cities Case Study: Ali Gholi Agha Quarter, Isfahan
The boundary of quarter is among the subjects that have been widely addressed in urban planning and urban design research. Clearly, several studies have examined the issue of “quarter boundaries in the historical fabric of Iranian cities”, but the literature review shows that there are still ambiguities in this regard. There are two contradictory answers to this issue: one group of studies ...
متن کاملStatistical analysis of minimum cost path based structural brain connectivity
Diffusion MRI can be used to study the structural connectivity within the brain. Brain connectivity is often represented by a binary network whose topology can be studied using graph theory. We present a framework for the construction of weighted structural brain networks, containing information about connectivity, which can be effectively analyzed using statistical methods. Network nodes are d...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملThe minimum barrier distance
In this paper we introduce a minimum barrier distance, MBD, defined for the (graphs of) real-valued bounded functions fA, whose domain D is a compact subsets of the Euclidean space R. The formulation of MBD is presented in the continuous setting, where D is a simply connected region in R, as well as in the case where D is a digital scene. The MBD is defined as the minimal value of the barrier s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INTERNATIONAL JOURNAL OF MANAGEMENT & INFORMATION TECHNOLOGY
سال: 2013
ISSN: 2278-5612
DOI: 10.24297/ijmit.v4i2.4625