期刊文献+

2-Competition Index of Primitive Digraphs Using Graph Theory 被引量:3

2-Competition Index of Primitive Digraphs Using Graph Theory
下载PDF
导出
摘要 Recently,scrambling index and competition index are widely applied to stochastic matrices and food webs. By analyzing the relationship of scrambling index and 2-competition index,n-「d/2」+ 1 was proved to be an upper bound of the 2-competition2 index of a primitive digraph with exact d loops in this article.Moreover,the maximum index problem and the index set problem for the 2-competition index of primitive digraphs with minimally strong digraphs were settled. Recently,scrambling index and competition index are widely applied to stochastic matrices and food webs. By analyzing the relationship of scrambling index and 2-competition index,n-「d/2」+ 1 was proved to be an upper bound of the 2-competition2 index of a primitive digraph with exact d loops in this article.Moreover,the maximum index problem and the index set problem for the 2-competition index of primitive digraphs with minimally strong digraphs were settled.
出处 《Journal of Donghua University(English Edition)》 EI CAS 2014年第3期320-324,共5页 东华大学学报(英文版)
基金 National Natural Science Foundations of China(No.11272100,No.50865001)
关键词 2-competition index primitive digraphs minimally strong digraphs 竞争指数 有向图 图论 食物链 矩阵和 指数和 索引 指数集
  • 相关文献

参考文献12

  • 1Akelbek M,Kirkland S.Primitive Digraphs with the Largest Scrambling Index[J].Linear Algebra and Its Application,2009,430(4):1099-1110.
  • 2Kim H K.Generalized Competition Index of a Primitive Digraph[J].Linear Algebra and Its Application,2010,433 (1):72-79.
  • 3Kim H K.A Bound on the Generalized Competition Index of a Primitive Matrix Using Boolean Rank[J].Linear Algebra and Its Application,2011,435(9):2166-2174.
  • 4Kim H K,Lee S H.Generalized Competition Indices of Symmetric Primitive Digraphs[J].Discrete Applied Mathematics,2012,160(10/11):1583-1590.
  • 5Kim H K,Park S G.Generalized Competition Indices of Symmetric Primitive Digraphs[J].Linear Algebra and Its Application,2012,436(1):86-98.
  • 6Kim H K.Generalized Competition Index of an Irreducible Boolean Matrix[J].Linear Algebra and Its Application,2013,438(6):2747-2756.
  • 7Kim H K.Scrambling Index Set of Primitive Digraphs[J].Linear Algebra and Its Application,2013,439 (7):1886-1893.
  • 8Liu B L,Huang Y F.The Scrambling Index of Primitive Digraphs[J].Computers and Mathematics with Applications,2010,60(3):706-721.
  • 9Shao Y L,Gao Y B,Li Z S.The m-competition Indices of Symmetric Primitive Digraphs without Loops[J].Electronic Journal of Linear Algebra,2012,23:457-472.
  • 10Shao Y L,Gao Y B.The m-competition Indices of Symmetric Primitive Digraphs with Loops[J].Ars Combination,2013,108:217-223.

同被引文献40

  • 1Ben-Israel A,Greville T N E.Generalized Inverses:Theory and Applications[M].2nd ed,New York:Springer,2003.
  • 2Bapat R B.Graphs and Matrices[M].London/New Delhi:Springer/Hindustan Book Agency,2010.
  • 3Bapat R B,Gupta S.ResistanceDistance in Wheels and Fans[J].Indian Journal of Pure and Applied,Mathematics,2010,41(1):1-13.
  • 4Klein D J,Randic M.Resistance Distance[J].Journal of Mathematical Chemistry,1993,12(1):81-95.
  • 5Klein D J.Resistance Distance Sum Rules[J].Croatica Chemica Acta,2002,75(2):633-649.
  • 6Chen H Y,Zhang F J.Resistance Distance and the Normalized Laplacian Spectrum[J].Discrete Applied Mathematics,2007,155(5):654-661.
  • 7Xiao W J,Gutman I.Relations between Resistance and Laplacian Matrices and Their Applications[J].MATCH Communications in Mathematical and in Computer Chemistry,2004,51(51):119-127.
  • 8Xiao W J,Gutman I.Resistance Distance and Laplacian Spectrum[J].Theoretical Chemistry Accounts,2003,110(4):284-289.
  • 9Yang Y J,Klein D J.A Recursion Formula for Resistance Distances and Its Applications[J].Discrete Applied Mathematics,2013,161(16/17):2702-2715.
  • 10Bapat R B.Resistance Matrix of a Weighted Graph[J].MATCH Co mmunications in Mathematical and in Computer Chemistry,2004,50(50):73-82.

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部