维普中文期刊产品整合服务
16篇 您的检索式:作者名="Dankelmann P"
    题名 作者 年代 出处 被引量
1On the degree distance of a graph显示文摘Dankelmann P Gutman I Mukwembi S 2009Discrete Appl Math2009,157,13:1
2On strong distance in oriented graphs显示文摘Dankelmann P Swart H C Day D P 2003Discrete Math2003,266,:1
3Degree sequence conditions for maximally edge - connected graph depending on the clique number 显示文摘Dankelmann P Volkmann L 2000Discrete Math2000,211,:1
4The edge-Wiener index of a graph 显示文摘DANKELMANN P GUTMAN I MUKWEMBI S 2009Discrete Mathe- matics2009,309,:1
5Degree sequence conditions for maximally edge -connected graphs and digraphs显示文摘Dankelmann P Volkmann L 1997J Graph Theory1997,26,:1
6Some Centrality Results New and Old 显示文摘Everett M Sinclair P Dankelmann P 2004Journal of Mathematical Sociology2004,28,4:1
7Diameter and Inverse Degree显示文摘Dankelmann P Swart H C van den Berg P 2008Discrete Math2008,308,56:1
8Average distance and independences numbers显示文摘DANKELMANN P 1994Discrete Appl Math1994,51,:1
9Inverse Degree and Edge-connectivity显示文摘Dankelmann P Hellwig A Volkmann L 2009Discrete Math2009,309,9:1
10Average distance and domination number显示文摘DANKELMANN P 1997Discrete Appl Math1997,80,:1
11Twin domination in digraph显示文摘CHARTRAND G DANKELMANN P SCHULTZ M SWART H C 2003Ars Combinato-ria2003,67,4:1
12Bounds on the average connectivity of a graph显示文摘Dankelmann P Oellermann O R 2003Discrete Appl Math2003,129,:1
13Twin domination in digraphs显示文摘Chartrand G Dankelmann P Schultz M 2003Ars Comb2003,67,:1
14New sufficient conditions for equality of minimum degree and edge?connectivity显示文摘DANKELMANN P VOLKMANN L 1995Ars Combin1995,40,:1
15The edge-Wiener index of a graph显示文摘Dankelmann P Gutman I Mukwembi S 2008Discrete Mathematics2008,48,1:1
16Average distance and domination numbers 显示文摘Dankelmann P 1997Discrete Application Mathematics1997,80,:1
返回顶部 每页显示:
共1页 首页 上一页 第1页 下一页 末页 /1 跳转

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

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