Transformations of assembly number for 4-regular graphs

Авторы: Guterman A.E., Kreines E.M., Ostroukhova N.V.
Журнал: Journal of Mathematical Sciences
Том: 262
Год издания: 2022
Издательство: Plenum Publishers
Местоположение издательства: United States
Первая страница: 11
Последняя страница: 26
DOI: 10.1007/s10958-022-05795-y
Аннотация: Simple assembly graphs characterize the process of DNA recombination in living cells. The assembly number, number of distinct Hamiltonian sets of polygonal paths, one-sided and middle additivity of a graph are important characteristics of such graphs. This paper investigates transformations of simple assembly graphs that allow one to increase their assembly numbers or to obtain middle additive graphs. Also the minimum number of loops that must be added to the edges of a tangled cord graph in order to increase its assembly number by 1 is computed.
Добавил в систему: Крейнес Елена Михайловна

	ИСТИНА	Войти в систему Регистрация
	ФНКЦ РР
	Главная Поиск Статистика О проекте Помощь

ИСТИНА