The exact expression for the effective resistance between any two vertices of the -cycle graph with four nearest neighbors , is given. It turns out that this expression is written in terms of the effective resistance of the -cycle graph , the square of the Fibonacci numbers, and the bisect...
reviewed,while only for odd n the quantumness can be revealed.Motivated by this,we propose the degree of non-commutativity and the degree of uncertainty to measure the quantumness in the n-cycle graphs.As desired,these two measures can detect the quantumness of any n-cycle graph when n≥4...
摘要: We consider decompositionsK n H, whereH is eitherP 3 (the path with 3 edges) or the complete bipartite graphK 1, 3, with the property that upon taking the complement of each graph in the decomposition one obtains a new decompositionK n H c ....
10.Cyclic Cycle Decompositions of the Complete Bipartite Graph K_(n, n) and the Edge-Balance Index Sets完全二部图K_(n,n)的循环圈分解及边—平衡指数集 11.Nutritional Cycling and Transformation Processes of Carbon and Nitrogen in Rice Cropping System of Red Soil Region of China;红壤稻田系统养分...
Hi All. Is there anyLINEARalgorithm to find the diameter of a graph, which have only one cycle(N vertexes, N paths)? For both ways you divide the problem into two parts. The first path is to erase the cycle and for every tree in the resulting forest to find the diameter. ...
We will call the random partition model described in the preceding sentence a uniform model and denote it by Πn,k because of its similarity to the uniform random graph model. Some related results on the issues concerning the largest parts and multiplicities of parts in random compositions can ...
Let m_i(1≤i≤r) be positive integer,∑ri=1m_i=2~k,k≥1.K_(n,n) be a complete bipartite graph and I be a one-factor of K_(n,n).It is proved that K_(n,n)\I can be decomposed into (m_1,m_2,…,m_r)-cycles if and only if 2~k|n(n-1) and n is odd.Moreover...
Let M be a connected graph with M {W1,W1,1,W1,2,W1,3}. We prove that there is an arbitrary length cycle from 3 to |V (Q3/r - W)| if the faulty component is no more than r-1 and every fault componen...
cyclic structure of a graph and its use as a preprocessing step in several algorithms. That is, a cycle basis is used as an input for a later algorithm, and using a minimum cycle basis instead of any arbitrary cycle basis usually reduces the amount of work that has to be done by this...
本文主要讨论 Petersen图的一类推广图——n圈中辐图的团覆盖数和团划分数 ,由此得出该图的团覆盖数和团划分数相等的结论 ,同时给出了其在不同情况下的计算公式 。 2) cycle in graph 图中的圈 例句>> 3) cycle in graph 图形中的圈 4) neutron radiography image ...