维普期刊资源整合服务平台（V6.5）

73篇 您的检索式：期刊名="Inform Processing Lett"

选中清除导出查看参考文献查看引证文献引用追踪共4页首页上一页第1页下一页末页 /4 跳转

	题名	作者	年代	出处	被引量
1	Vertex vulnerability parameters of Kronecker product of complete graphs显示文摘	Mamut A Vumar E	2008	Inform Process Lett2008，106，：	1
2	Connectivity and edge-disjoint spanning trees显示文摘	Gusfield D	1983	Inform Process Lett1983，16，：	1
3	On the number of spanning trees of multi-star related graphs显示文摘	Nikolopoulos S D Rondogiannis P	1998	Inform Process Lett1998，，65：	1
4	A formula for the number of spanning trees of a multi-star related graph显示文摘	Yan W M Myrvold W Chung K L	1998	Inform Process Lett1998，，68：	1
5	On the number of spanning trees of a multi-complete/star related graph显示文摘	Chung K L Yan W M	2000	Inform Process Lett2000，，76：	1
6	A comment on the 'basic security theorem' of bell and LaPadula显示文摘	John McLean	1985	Information Processing Lettes1985，20，2：	1
7	Planar graphs with cycles of length neither 4 nor 6 are( 2,0,0)-colorable 显示文摘	XU J WANG Y	2013	Inform Process Lett2013，113，18：	1
8	The 2-dipath chromatic number of Halin graphs显示文摘	Chen Min Wang Weifan	2006	Inform Process Lett2006，99，2：	1
9	Some remarks on the Kronecker product of graphs显示文摘	Bottreou A M~tivier Y	1998	Inform Process Lett1998，68，：	1
10	On computing a conditional edge connectivity of a graph显示文摘	Esfahanian A Hakimi S	1989	Inform Process Lett1989，27，：	1
11	On edge connectivity of direct products of graphs显示文摘	Cao X L Brglez S ~ pacapan S	2011	Inform Process Lett2011，111，：	1
12	The edge Hamihonian path problem is NP- complete 显示文摘	Bertossi A A	1981	Inform Process Lett1981，13，45：	1
13	On toughness and fractional (g,f,n)-critical graphs显示文摘	LIU S	2010	Inform Process Lett2010，110，：	1
14	A scheme to construct distance-three codes, with applications to the n-cube显示文摘	Jha P k Slutzki G	1995	Inform Process Lett1995，55，：	1
15	New bounds on the size of the minimum feedback vertex set in butterflies显示文摘	Caragiannis I Kaklamanis C Kanellopoulos P	2002	Inform Process Lett2002，83，5：	1
16	Scheduling jobs under decreasing linear deterioration显示文摘	Wang Jibo Xia Zunquan	2005	Inform Process Lett2005，94，：	1
17	A series expansion involving the harmonic numbers显示文摘	Zave D A	1976	Inform Process Lett1976，5，3：	1
18	Absorbant of generalized de Bruijn digraphs显示文摘	Shan E F Cheng T C E Kang L Y	2007	Inform Process Lett2007，105，：	1
19	On the number of spanning trees of amulticomplete/star related graph显示文摘	CHUNG K L YAN W M	2000	Inform Process Lett2000，，76：	1
20	On computing a conditional edge connectivity of a graph显示文摘	Esfahanian A H Hakimi S L	1988	Inform Process Lett1988，27，4：	1

返回顶部每页显示：

共4页首页上一页第1页下一页末页 /4 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示