digraphs 中文意思是什麼
digraphs
解釋
二合字母-
Digraphs have a simple pictorial representation.
有向圖有簡單的圖形表示。 -
Some results on the existence of integral digraphs
關于有向整譜圖的若干存在性問題 -
These include " digraphs " and additional reserved words
包括「雙連符」和額外的保留詞。 -
On the gracefulness of the union of mutually non - intersecting digraphs n
3之並的優美性 -
Exponents of a class of two - colored digraphs
一類雙色有向圖的指數 -
The upper bounds of the spectral radius of digraphs in term of average 2 - degrees
有向圖的譜半徑的二次度形式的上界 -
In the paper, the connectivity and diameters of sell - complementary 2 - multigraphs and sell - complementary digraphs are discussed, and if these graphs get disrupted the relations for the number ob edges and vertices between the two connected components are also studied in self - complementary permutation
摘要本文討論了2 -重自補圖和有向自補圖的連通性以及2 -重自補圖的直徑，同時以自補置換作為工具研究了當2 -重自補圖或有向自補圖被分成兩個連通分支后，這兩個連通分支之間的邊數與頂點數之間的關系。 -
Nonetheless, those alternative tokens that aren ' t lexical keywords are colloquially known as " digraphs "
雖然如此，這些不是關鍵字詞匯的候選標記仍被通俗地稱為「雙連符」 。 -
Particularly, explicit expression for connectivity of cayley digraphs is given, doom and meng ' s results are also generalized and improved. at last, cayley digraphs with optimal connectivity are analyzed
特別地，給出了cayley圖連通度的精確表達式，推廣並改進了doorn和孟吉祥的結果，並在最後分析了一些達到最優連通度的cayely圖類。 -
Generalized primitive exponents of digraphs are generalizations of traditional primitive exponents of primitive digraphs, with applications in memoryless communication systems
有向圖的廣義本原指數是本原有向圖傳統本原指數的推廣，應用在非記憶通訊系統中。 -
The main results are : ( 1 ) we give an upper bound for kth generalized primitive exponents of primitive digraphs with order n and girth 2, and determine the exponent set of this class digraphs in section 2
主要內容有三部分： （ 1 ）第2節給出了圍長為2的n階本原有向圖的第k個頂點指數（ exp _ d （ k ） ）的上界及相應的指數集。 -
( 2 ) we give an upper bound for kth generalized primitive exponents of non - primitive digraphs with order n and girth 2, determine the exponent set of this class digraphs in section 3, and discuss the extreme cases
（ 2 ）第3節給出了圍長為2的n階非本原有向圖的第k個頂點指數（ exp _ d （ k ） ）的上界及相應的指數集，討論了極端情形。 -
Using matrix theory, we present a sharp upper bound on the spectral radius of digraphs and strongly connected diagraphs
摘要利用矩陣理論，給出了簡單有向圖的譜半徑可達上界和強連通有向圖的譜半徑上界。 -
It is proved that seymour ' s second out - degree conjecture holds if and only if it holds for strong connected digraphs
證明了seymour二出度猜想成立等價于該猜想在強連通有向圖上成立。 -
Connectivity is discussed particularly, and some new conceptions are proposed, such as atom matching, atom - contracted digraph and atom stabilizer subgroup, based on which the structure characteristic of vertex - transitive digraphs is analyzed further, and current connectivity theory on vertex - transitive digraphs is consummated
重點討論了點可遷圖的連通性及連通度，提出了原子匹配、原子收縮圖、原子穩定子群等一些新的概念，在此基礎上進一步分析了點可遷圖的結構特徵，完善了現有的點可遷圖的連通性理論。 -
Generation method of minimal - complete - coverage interoperability test sequence based on digraphs
基於有向圖的最小完全覆蓋互操作測試序列生成演算法 -
The properties of binding number are discussed, the value scope of binding number is obtained, and the existence of digraphs with a given binding number is proved. two conjectures on the relationship between binding number and girth are proposed
在此基礎上，論文討論了有向圖結合數的性質，得到了結合數的范圍並論證了給定結合數的有向圖的摘要存在性，提出了關于結合數與圍長之間聯系的兩個猜想 -
In chapter 4, the conception of binding number of undirected graphs is introduced to digraphs, based on which the relationship between degree condition of vertices and girth is generalized to the relationship between neighborhood condition of vertices sets and girth
由於若無向圖g的結合數b （ g ） 3 / 2 ，則g中存在三角形，而caccetta - h （ ? ） ggkvist猜想研究有向圖中存在有向三角形的條件，受此啟發，我們在有點向圖中引入結合數的概念。 -
This thesis contributes to directed cycles in digraphs, including the relations between the girth g ( d ) ( length of the shortest directed cycle ) of d and degrees of vertices of d and between the shortest directed cycle of d and the binding number of d, among which vertex - transitive digraphs are studied in detail
本篇論文主要研究有向圖中的有向圈，討論有向圖中的圍長g （ d ） （最短有向圈的長度）與圖的頂點度以及結合數之間的關系，並重點分析了點可遷圖類。 -
The theory of graphs can be roughly partitioned into two branches : the areas of undirected graphs and directed graphs ( digraphs )
圖論大致可分為兩個方向：無向圖與有向圖。
分享友人