Iskanje po repozitoriju

Opis: The three subgraphs of a connected graph induced by the center, annulus and periphery are called its metric subgraphs. The main results are as follows. (1) There exists a graph of order n whose metric subgraphs are all paths if and only if n ≥ 13 and the smallest size of such a graph of order 13 is 22; (2) there exists a graph of order n whose metric subgraphs are all cycles if and only if n ≥ 15, and there are exactly three such graphs of order 15; (3) for every integer k ≥ 3, we determine the possible orders for the existence of a graph whose metric subgraphs are all connected k-regular graphs; (4) there exists a graph of order n whose metric subgraphs are connected and pairwise isomorphic if and only if n ≥ 24 and n is divisible by 3. An unsolved problem is posed.
Ključne besede: center, annulus, periphery, metric subgraphs, path, cycle
Objavljeno v RUP: 16.09.2025; Ogledov: 349; Prenosov: 11
Celotno besedilo (533,77 KB)
Gradivo ima več datotek! Več...