典型文献
Rainbow and Monochromatic Vertex-connection of Random Graphs
文献摘要：
A vertex-colored path P is rainbow if its internal vertices have distinct colors;whereas P is monochromatic if its internal vertices are colored the same.For a vertex-colored connected graph G,the rainbow vertex-connection number rvc(G)is the minimum number of colors used such that there is a rainbow path joining any two vertices of G;whereas the monochromatic vertex-connection number mvc(G)is the maxi-mum number of colors used such that any two vertices of G are connected by a monochromatic path.These two opposite concepts are the vertex-versions of rainbow connection number rc(G)and monochromatic connection number mc(G)respectively.The study on rc(G)and mc(G)of random graphs drew much attention,and there are few results on the rainbow and monochromatic vertex-connection numbers.In this paper,we consider these two vertex-connection numbers of random graphs and establish sharp threshold functions for them,respectively.
文献关键词：
中图分类号：
作者姓名：
Wen-jing LI;Hui JIANG;Jia-bei HE
作者机构：
School of Mathematics and Statistics,North China University of Water Resources and Electric Power,Zhengzhou 450046,China;School of Mathematics,Hefei University of Technology,Hefei 230000,China
文献出处：
引用格式：
[1]Wen-jing LI;Hui JIANG;Jia-bei HE-.Rainbow and Monochromatic Vertex-connection of Random Graphs)[J].应用数学学报（英文版）,2022(04):966-972
A类：
Monochromatic,rvc,mvc
B类：
Rainbow,Vertex,connection,Random,Graphs,vertex,colored,path,rainbow,if,its,internal,vertices,have,distinct,colors,whereas,monochromatic,are,same,For,connected,minimum,used,such,that,there,joining,any,two,maxi,by,These,opposite,concepts,versions,rc,mc,respectively,study,random,graphs,drew,much,attention,few,results,numbers,In,this,paper,we,consider,these,establish,sharp,threshold,functions,them
AB值：
0.41609
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
