無圈圖 的英文怎麼說
中文拼音 [wújuāntú]
無圈圖
英文
acyclic graph-
G is a maximal acyclic graph.
G是一個極大無圈圖。G is a maximal acyclic graph
G是一個極大無圈圖。A circ is an undirected graph having only vertices of even nonzero degree.
一廣義圈是一無向圖，其頂點次數都是非零偶數。Claw - free graphs have been a subject of interest of many authors in the recent years. the first motivation for studying properties of claw - free graphs apparently appeared from the beineke ' s characterization of line graphs in [ 4 ], [ 5 ]. however, the main impulse that turned the attention of the graph theory community to the class of claw - free graphs was given in late 70s and early 80s. during the period some first results on hamiltonian properties were proved in [ 6 ], [ 7 ], [ 8 ], [ 9 ]. prom then on, more and more authors began to study the problem of hamilton. they studied mainly in the following two aspects : cycle aspect and path aspect. we may obtain some results about cycle in [ 3 ] and [ 10 - 30 ]
研究該圖類的最初動機來源於deineke [ 4 ] ， [ 5 ]線圖的特性，然而引起人們尤其注意是在70年代末80年代初，整個這個時期在[ 6 ] ， [ 7 ] ， [ 8 ] ， [ 9 ]中關于哈密頓性質的一些初步結果被證明從此用無爪圖來研究哈密頓問題日益活躍，人們主要從以下兩個方面來研究：圈方面和路方面其中關于圈方面的部分結果可參見文獻[ 3 ]及[ 10 - 30 ]等The two circular pieces of cut fruit present an image of the sun and moon, that either hints of the infinity of time and space, the brilliant light of dawn, or the tender light of the moon at night
切開的金果的那兩個圓圈，看似一幅日與月的圖畫，讓欣賞者聯想到無限的空間。空間：似黎明絢燦的陽光或似夜間柔和的月光。A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removing the vertex subset from the graph
摘要若從一個圖中去掉某些頂點后得到的導齣子圖是無圈圖，則所去的那些頂點組成的集合就是原圖的反饋點集。If you were to block out the outermost diffracted orders by placing an opaque mask at the rear of the objective, you could reduce the resolution of the lines of the grating, or any other detailed object, or " destroy " the resolution altogether so that the specimen would not be visible
假如用不透明的遮擋物在物鏡后焦面擋住外圈衍射級的光線，線形柵格圖像的解析度將下降，這樣完全地破壞了解析度，標本的細節就無法看見。Among them the applications with the general local lemma arc the most important, such as acyclic edge colorings of graphs. we prove that the acyclic edge chromatic number of g is less than or equal to a + 2 for any graph g whose girth is at least 700 log
） sz局部引理給出應用實例，即無圈邊染色，證明了當圖g的圍長大於等於700 log時，圖g的無圈邊色教小於等於+ 2然後，用概率論的方法證明了幾種形式的lov （In this paper three different types of colorings are studied, which are incidence coloring of graphs, acyclic edge coloring and strong edge coloring
本文研究了三種不同的著色：圖的關聯著色、無圈邊著色和強邊著色。Many data such as m / g, em and seismic have been arranged, processed and interpreted in shengli oilfield, in which, the interpreted data ( 2 - d ) are 64 lines with 1800km. the techniques such as integration of process and interpretation, joint interpretation of m / g, em and seismic, variable velocity mapping, pressure prediction, constraint inversion without well and special process have been applied. the comprehensive researches on geology and physical exploration have been carried out in the whole block
該區油氣勘探始於50年代，勝利油田在該區塊先後部署、處理、解釋了重、磁、電、震等多種資料，其中解釋地震資料（ 2d ） 64條、 1800多公里，才用了處理解釋一體化、重、磁、電、震聯合解釋、變速成圖、壓力預測、無井約束反演、特殊處理等技術，對整個探區進行了地質、物探等綜合研究，發現兩個有利構造帶，落實了13個圈閉構造，提交了兩口探井井位。The graphs which we consider here are finite, undirected, simple and loopless
這里考慮的圖是有限的、無向的、無圈的簡單圖。We prove that halin graphs, 1 - trees and outerplanar graphs satisfy the conjecture presented by n. alon that the acyclic edge chromatic number of any graph does not exceed its maximum degree plus 2
證明了halin圖、 1 -樹和外平面圖滿足由n . alon提出的任何一個圖的無圈邊色數不超過其最大度加2的猜想。Several authors observed that the assumptions of theorem a imply stronger cycle properties. hendry [ 3 ] ( and, later on independently ambartsumian et al [ 11 ] ) proved the following theorem : theorem b [ 3 ], [ 11 ] every connected, locally connected claw - free graph on at least three vertices is fully cycle extendable
后來，許多圖論專家發現該定理的條件暗含著更強的圈性質，其中hendry [ 3 ] （后來ambartsumianetal獨立地）證明了下面的定理：定理b頂點數不小於3的連通、局部連通的無爪圖是完全圈可擴的About almost claw - free graph, ryjacek proved the following theorem in [ 12 ]. theorem c [ 12 ] every connected, locally connected k1, 4 - free almost claw - free graph is fully cycle extendable
在幾乎無爪圖方面ryjdeek 『司證明了下面的結論：定理c卜連通、局部連通的ki ， 4 f陀e的幾乎無爪圖是完全圈可擴的In section 2. 2, we prove that if the set of arrows in a quiver is not empty, then nq is not semisimple. we construct the nonsovable subalgebra of nq when there is no less than one circle whose length is bigger than one, and there is no loop in quiver q, thus leads to a conclusion that nq is nonsovable. using the index arrays to discuss the operation of necklace word. construct a sovable subalgebra of nq, which is not nilpotent. this shows that nq is not nilpotent provided that there is a cyclic with length bigger than 1
當箭圖中有長度大於1的循環，且無圈時，構造了n _ q的非可解子代數，從而證明了n _ q是不可解李代數。我們還利用指標數組討論了項鏈字的運算，構造了n _ q的可解非冪零子代數，從而證明了當箭圖中有長度大於1的循環時，項鏈李代數非冪零。在2In this paper we intrest in the following results of cycle : oberly and sumner proved the following result in [ 10 ] : theorem a [ 10 ] if g is a connected, locally connected claw - free graph on n > 3 vertices, then g is hamiltonian
本文感興趣的是圈方面的以下結果： oberlyandsumner [ 10 ]證明了下面的結果：定理a頂點數不小於3的連通、局部連通的無爪圖是哈密頓圖Supreme master ching hai has said, " our way home was paved inside us long ago. should we forget this lifesaving map, we will be forever trapped in the cycle of life and death.
清海無上師說：回家的路早已烙印在我們內邊，如果忘了這張救命的地圖，我們將永遠困在生死圈裡跑不開。Circumference in three - connected claw - free graphs
連通無爪圖的最長圈An implicit degree condition for hamiltonian cycles in k - connected claw - free graphs
連通無爪圖中存在哈密爾頓圈的一個隱度條件Apparently, that g is fully cycle extendable which implied hamiltonicity is a stronger result than g is hamiltonian, so that we study the problem of fully cycle extendable is equate to study the hamiltonian problem which is one of the four difficult problems in graph theory. later on, many authors oberserved many other special classes of graphs by improved claw - free graphs because they are not satisfied with the study of claw - free graphs
顯然圖g是完全圈可擴的是比圖g是哈密頓圖更強的結果，所以研究完全圈可擴問題就研究了圖論的難題之一哈密頓問題后來人們不滿足於無爪圖的研究，把無爪圖進行改進得到了一系列的特殊圖類分享友人