Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A new result about panconnectivity on graphs

A new result about panconnectivity on graphs LetG be a simple graph such that the sum of the degrees of any two independent vertices ofG is at leastn−1. We shall prove thatG is [6,n]-panconnected except for four kinds of graphs. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

A new result about panconnectivity on graphs

Loading next page...
 
/lp/springer-journals/a-new-result-about-panconnectivity-on-graphs-PAK0mz63Z5

References (5)

Publisher
Springer Journals
Copyright
Copyright © 1991 by Science Press, Beijing, China and Allerton Press, Inc., New York, U.S.A.
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02006100
Publisher site
See Article on Publisher Site

Abstract

LetG be a simple graph such that the sum of the degrees of any two independent vertices ofG is at leastn−1. We shall prove thatG is [6,n]-panconnected except for four kinds of graphs.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 13, 2005

There are no references for this article.