Year: 2020
Type: article
Abstract: An induced path factor of a graph is a set of induced paths in with the property that every vertex of is in exactly one of the paths. The induced path number of is the minimum number of paths in an induced path factor of . We show that if is a connected cubic graph on vertices, then . Fix an integer . For each , define to be the maximum value of over all connected ‐regular graphs on vertices. As with even, we show that exists. We prove that and and that for .
Source: Journal of Graph Theory
DOI: 10.1002/jgt.22654
Authors: Saieed Akbari, Daniel Horsley, Ian M. Wanless
Institutions: Sharif University of Technology, Monash University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Australian Research Council
Award: G818064980
OpenAlex ID: W2891222033