Diameter in iterated path graphs
نویسندگان
چکیده
منابع مشابه
On the maximum diameter of path-pairable graphs
A graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in each pair. We obtain sharp bounds on the maximum possible diameter of path-pairable graphs which either have a given number of edges, or are cdegenerate. Along the way we show that a large family of graphs obtained by blowing up a path is path-pairable, which may be of independent...
متن کاملNote on the diameter of path-pairable graphs
A graph on 2k vertices is path-pairable if for any pairing of the vertices the pairs can be joined by edge-disjoint paths. The so far known families of path-pairable graphs have diameter of atmost 3. In this paperwe present an infinite family of path-pairable graphswith diameter d(G) = O( √ n) where n denotes the number of vertices of the graph. We prove that our example is extremal up to a con...
متن کاملOn Diameter of Line Graphs
The diameter of a connected graph $G$, denoted by $diam(G)$, is the maximum distance between any pair of vertices of $G$. Let $L(G)$ be the line graph of $G$. We establish necessary and sufficient conditions under which for a given integer $k geq 2$, $diam(L(G)) leq k$.
متن کاملIterated Path Integrals
The classical calculus of variation is a critical point theory of certain differentiable functions (or functional) on a smooth or piecewise smooth path space, whose differentiable structure is defined implicitly. Because of the importance of path spaces to analysis, geometry and other fields, it is desirable to develop a geometric integration theory or a de Rham theory for path spaces. Having i...
متن کاملIterated colorings of graphs
For a graph property P, in particular maximal independence, minimal domination and maximal irredundance, we introduce iterated P-colorings of graphs. The six graph parameters arising from either maximizing or minimizing the number of colors used for each property, are related by an inequality chain, and in this paper we initiate the study of these parameters. We relate them to other well-studie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00234-x