D - digraph 中文

digraph n.(讀作一音的)復合字母〔如 ch, ea〕。

n. (讀作一音的)復合字母〔如 ch, ea〕。 “acyclic digraph“ 中文翻譯：無圈有向圖, 非循環有向圖“arc-digraph“ 中文翻譯：弧有向樹“associated digraph“ 中文翻譯：伴隨有向圖“balanced digraph“ 中文翻譯：平衡有向圖“complete digraph“ 中文翻譯：完全有向圖“contrafunctional digraph“ 中文翻譯：逆函數有向圖“converse digraph“ 中文翻譯：逆有向圖“cospectral digraph“ 中文翻譯：同譜在向圖“diconnected digraph“ 中文翻譯：雙向連通圖“digraph coding“ 中文翻譯：兩個字母拼成一個單音編碼; 兩個字母拼成一個單音的編碼“digraph with source“ 中文翻譯：有源的有向圖“disconnected digraph“ 中文翻譯：不連接有向圖; 不連通有向圖“euler digraph“ 中文翻譯：歐拉有向圖“eulerian digraph“ 中文翻譯：歐拉有向圖“functional digraph“ 中文翻譯：函數圖形, 函數雙圖形, 函數有向圖“line digraph“ 中文翻譯：線有向圖“primitive digraph“ 中文翻譯：本原有向圖; 原始有向圖“program digraph“ 中文翻譯：程序有向圖“signed digraph“ 中文翻譯：符號雙字音技術; 符號有向圖“simple digraph“ 中文翻譯：簡單有向圖“strict digraph“ 中文翻譯：嚴格有向圖“strong digraph“ 中文翻譯：強雙圖; 強有向圖“symmetric digraph“ 中文翻譯：對稱有向圖“transitive digraph“ 中文翻譯：可遷有向圖“digranes“ 中文翻譯：迪格拉半島“digraph representation of a structure“ 中文翻譯：結構的有向圖表示法

digress
And meantime a - doubly diagonally dominant matrices was studied in detail . the paper points out that as long as we examine the related quantity involved in the circuit of the associated digraph of matrices we may determine whether a matrix is a non - singular m - matrices or not 同時詳細研究了-雙對角占優矩陣，指出只要對矩陣伴隨有向圖圈中所涉及到的相關量進行驗證即能判別一個矩陣是否為非奇異m -矩陣。
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 在此基礎上，論文討論了有向圖結合數的性質，得到了結合數的范圍并論證了給定結合數的有向圖的摘要存在性，提出了關于結合數與圍長之間聯系的兩個猜想
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圖類。
Many results on undirected vertex - transitive graphs are applied on directed cases in parallel . and some different conclusions from undirected case are obtained . it is proved that the above two conjectures hold for vertex - digraphs 我們將許多無向點可遷圖的結果平行地推廣到有向點可遷圖中，同時得到了一些不同與無向圖情形的結論。
The term “ digraph “ ( token consisting of two characters ) is not perfectly descriptive , since one of the alternative preprocessing - tokens is % : % : and of course several primary tokens contain two characters 術語“雙連符” （包含兩個字符的標記）的表達效果比較差，因為一個候選預處理標記為% : % : ，并且幾個首選標記也有兩個字符。
( 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 ) )的上界及相應的指數集，討論了極端情形。
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 ) )的上界及相應的指數集。
( 3 ) we give an upper bound for lewin index , which is related to generalized primitive exponents of primitive digraph of order n and girth 2 , determine the index set of this class digraph and discuss the extreme cases ( 3 )第4節分析了圍長為2的n階本原有向圖的l ( g )的上界及相應的指數集，并討論了極端情形。
By means of the associated digraph of matrices we obtain the necessary and sufficient conditions of whether irreducibly doubly diagonally dominant matrices belongs to non - singular m - matrices 借助于矩陣的伴隨有向圖得到了不可約雙對角占優矩陣是否為非奇異m -矩陣的充分必要條件。
A uniquely pancyclic digraph is a digraph which has exactly one directed cycle of each length l , for 3 l v , where v is the number of vertices of the digraph 一個唯一泛圈有向圖是一個定向圖，且對3 l v的每個l ，它恰好有一個長為l的有向圈，這里的v表示有向圖的頂點數。
Let d be a digraph , c is the hamilton cycle of d , then the arcs in a ( d ) - a ( c ) are called the directed brigdes of d . the set of directed bridges of d is denoted by b ( d ) ( or b ) 設d是有向圖， d中不在有向hamilton圈上的弧稱為d的有向橋，用b ( d )或b表示d的有向橋的集合。
Generalized primitive exponents of digraphs are generalizations of traditional primitive exponents of primitive digraphs , with applications in memoryless communication systems 有向圖的廣義本原指數是本原有向圖傳統本原指數的推廣，應用在非記憶通訊系統中。
In this paper we deal with two aspects of applied mathematics , one is digraph theory and the other is infinite - dimensional linear system theory 本文將研究兩個方面的內容：有向圖理論與無窮維線性系統。這兩個方面是應用數學中的兩個非常重要的研究領域。
The determination of upper bounds and corresponding exponent sets for different digraph classes is an important problem in the study of generalized primitive exponents 廣義本原指數的上界和相應的指數集的確定是廣義本原指數研究的重要問題。
If d is a maximum uniquely pancyclic digraph and b is independent , then d is called to be a maximum uniquely pancyclic digraph with independent bridges 若d是最大唯一泛圈有向圖且b是獨立的，則稱d是包含獨立橋的最大唯一泛圈有向圖。
This paper consists of two chapters : chapter i is about digraph theory and chapter ii is about infinite - dimensional linear system theory 本文分別在第一章與第二章討論有關有向圖與無窮維線性系統的具體問題。
By using the matrix representation of a digraph , some results about the index of convergence and period of a line digraph are obtained 摘要采有有向圖的矩陣表示，得到了線有向圖的冪斂指數和周期的有關結果。
Using matrix theory , we present a sharp upper bound on the spectral radius of digraphs and strongly connected diagraphs 摘要利用矩陣理論，給出了簡單有向圖的譜半徑可達上界和強連通有向圖的譜半徑上界。
When a language that uses a digraph character is specified in the system locale settings , an occurrence of the single digraph character in either 當在系統區域設置中指定使用二合字母字符的語言時，在

名稱
說明
信箱
電話
圖片	移動背景圖固定背景圖重製上傳圖片

digraph

digraph n.(讀作一音的)復合字母〔如 ch, ea〕。

digress

Generalized primitive exponents of digraphs are generalizations of traditional primitive exponents of primitive digraphs , with applications in memoryless communication systems 有向圖的廣義本原指數是本原有向圖傳統本原指數的推廣，應用在非記憶通訊系統中。

The determination of upper bounds and corresponding exponent sets for different digraph classes is an important problem in the study of generalized primitive exponents 廣義本原指數的上界和相應的指數集的確定是廣義本原指數研究的重要問題。

If d is a maximum uniquely pancyclic digraph and b is independent , then d is called to be a maximum uniquely pancyclic digraph with independent bridges 若d是最大唯一泛圈有向圖且b是獨立的，則稱d是包含獨立橋的最大唯一泛圈有向圖。

This paper consists of two chapters : chapter i is about digraph theory and chapter ii is about infinite - dimensional linear system theory 本文分別在第一章與第二章討論有關有向圖與無窮維線性系統的具體問題。

By using the matrix representation of a digraph , some results about the index of convergence and period of a line digraph are obtained 摘要采有有向圖的矩陣表示，得到了線有向圖的冪斂指數和周期的有關結果。

Using matrix theory , we present a sharp upper bound on the spectral radius of digraphs and strongly connected diagraphs 摘要利用矩陣理論，給出了簡單有向圖的譜半徑可達上界和強連通有向圖的譜半徑上界。

When a language that uses a digraph character is specified in the system locale settings , an occurrence of the single digraph character in either 當在系統區域設置中指定使用二合字母字符的語言時，在