کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4649074 1632448 2007 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the number of closed walks in vertex-transitive graphs
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
On the number of closed walks in vertex-transitive graphs
چکیده انگلیسی

The results of Širáň and the first author [A construction of vertex-transitive non-Cayley graphs, Australas. J. Combin. 10 (1994) 105–114; More constructions of vertex-transitive non-Cayley graphs based on counting closed walks, Australas. J. Combin. 14 (1996) 121–132] are generalized, and new formulas for the number of closed walks of length prpr or pq, where p and q are primes, valid for all vertex-transitive graphs are found. Based on these formulas, several simple tests for vertex-transitivity are presented, as well as lower bounds on the orders of the smallest vertex- and arc-transitive groups of automorphisms for vertex-transitive graphs of given valence.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 307, Issues 3–5, 6 February 2007, Pages 484–493
نویسندگان
, , ,