نتایج جستجو برای: graph decomposition

تعداد نتایج: 291122  

Journal: :transactions on combinatorics 2012
samira hossein ghorban

let $n,t_1,...,t_k$ be distinct positive integers. a toeplitz graph $g=(v, e)$ denoted by $t_n$ is a graph, where $v ={1,...,n}$ and $e= {(i,j) : |i-j| in {t_1,...,t_k}}$.in this paper, we present some results on decomposition of toeplitz graphs.

Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...

Journal: :international journal of civil engineering 0
h. rahami university of tehran a. kaveh iran university of science and technology m. ardalan asl university of tehran s. r. mirghaderi university of tehran

in the process of structural analysis we often come to structures that can be analyzed with simpler methods than the standard approaches. for these structures, known as regular structures, the matrices involved are in canonical forms and their eigen-solution can be performed in a simple manner. however, by adding or removing some elements or nodes, such methods cannot be utilized. here, an effi...

Journal: :international journal of civil engineering 0
a. kaveh h.a. rahimi bondarabady l. shahryari

the main aim of this paper is to extend the recently developed methods for calculating the buckling loads of planar symmetric frames to include the effect of semi-rigidity of the joints. this is achieved by decomposing a symmetric model into two submodels and then healing them in such a manner that the ::::union:::: of the eigenvalues of the healed submodels result in the eigenvalues of the ent...

Journal: :Journal of Combinatorial Theory, Series B 1978

Journal: :ACM Transactions on Knowledge Discovery from Data 2019

Journal: :Journal of Graph Theory 2015

‎A tree containing exactly two non-pendant vertices is called a double-star‎. ‎Let $k_1$ and $k_2$ be two positive integers‎. ‎The double-star with degree sequence $(k_1+1‎, ‎k_2+1‎, ‎1‎, ‎ldots‎, ‎1)$ is denoted by $S_{k_1‎, ‎k_2}$‎. ‎It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching‎. ‎In this paper‎, ‎we study the $S_{1,2}$-decomposit...

Journal: :Journal of Physics: Conference Series 2018

Journal: :Banach Center Publications 1989

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید