S. D. Bedrosian, Generating formulas for the number of trees in a graph, J. Franklin Inst. 277 (1964), 313-326. MR MR0162240 (28 #5439)S.D. Bedrosian.Generating formulas for the number of trees in a graph. Journal of the Franklin Institute Engineering and Applied Mathematics . 1964...
Parking on a Random Tree 2 and recover in this way the known results on the integers and general regular trees [2, 7, 9]. 2 Proof Consider a fixed realization of the ... HG Dehling,SRF Külske - 《Journal of Statistical Physics》 被引量: 15发表: 2008年 On the graph of trees We...
The number of spanning trees of a graph with given matching number. Feng, Lihua,Xu, Kexiang,Das, Kinkar Ch,... - Computing Methods in Applied Sciences & Engineering - 1973 - 被引量: 0 On the number of a ...
spanning trees –selfsimilar graphsThe number of spanning trees of a graph, also known as the complexity, is computed for graphs constructed by a replacement procedure yielding a self-similar structure. It is shown that under certain symmetry conditions exact formulas for the complexity can be ...
the window phone the winner within the winter guest the winter in lisbon the winter is going t the winter was cold b the wisdom froggies the wisdom of a fool the wise man knows he the wise never marrya the wolfman trailer the wolfshead the woman first bough the woman who plays w the...
We investigate the expected value of various graph parameters associated with the minimum rank of a graph, including minimum rank/maximum nullity and relat... HLRB Hall - 《Linear Algebra & Its Applications》 被引量: 0发表: 2010年 On the Number of Steiner Trees in a Graph In a number of...
plant more trees plant mucilage plant nutrition plant pathology phyto plant pest control ve plant protection bull plant protection coll plant residuesplant r plant rice plant tissue plant transgenic tech plantaginales plantago deperssa wil plantar ligaments of plantar metatarsal li plantar surfaces toes ...
The number of trees weakly embedded in the hypercubic lattice, tn, is considered. It is known that limn to infinity tn1n/= lambda 0, and that tn<or= lambda 0n. These facts are proven by noting that trees satisfy a supermultiplicative inequality tntm<or=tn+m. A submultiplicative propert...
Let Gmn denote the set of simple graphs with n vertices and m edges, t ( G ) the number of spanning trees of a graph G, and F H if t ( Ks \ E ( F )) t ( Ks\E(H) ) for every s max{ v(F), v(H) }. We give a complete characterization of -maximal (maximum) graphs...
Let γ(G) and $γ_{2,2}(G)$ denote the domination number and (2,2)-domination number of a graph G, respectively. In this paper, for any nontrivial tree T, we show that $(2(γ(T)+1))/3 ≤γ_{2,2}(T) ≤ 2γ(T)$. Moreover, we characterize all the trees achieving the...