Zobrazeno 1 - 10
of 577
pro vyhledávání: '"forbidden subgraph"'
Autor:
Amir Rehman, S. Pirzada
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Pp 1-3 (2024)
Let G be a graph of size m and [Formula: see text] be the spectral radius of its adjacency matrix. A graph is said to be H-free if it does not contain a subgraph isomorphic to H. Let [Formula: see text] be the graph obtained by adding a pendent verte
Externí odkaz:
https://doaj.org/article/02d2e6163c7f48f18cdce86373520aaf
Autor:
Amir Rehman, Shariefuddin Pirzada
Publikováno v:
Acta Universitatis Sapientiae: Informatica, Vol 16, Iss 1, Pp 124-138 (2024)
Externí odkaz:
https://doaj.org/article/ba5cff8aed4841568f41ff43ff7ac7ce
Autor:
Mohammadian Ali, Xu Shanshan
Publikováno v:
Special Matrices, Vol 12, Iss 1, Pp 2131-2135 (2024)
We explicitly determine all connected graphs whose Laplacian matrices have at most four eigenvalues different from 1 and 2.
Externí odkaz:
https://doaj.org/article/fd6302ca02e74641bf2dbf32ca2022fb
Autor:
Guzmán-Pro, Santiago a, Hernández-Cruz, César b, ⁎
Publikováno v:
In Applied Mathematics and Computation 1 November 2024 480
Publikováno v:
In Discrete Mathematics November 2024 347(11)
Publikováno v:
In Discrete Mathematics February 2025 348(2)
Autor:
Wang, Qiang a, Xiong, Liming b, ⁎
Publikováno v:
In Discrete Mathematics February 2025 348(2)
Autor:
Choi, Myungho ⁎, Kim, Suh-Ryung
Publikováno v:
In Discrete Applied Mathematics 15 October 2024 355:30-45
Autor:
Liu, Yuxiang a, b, Wang, Ligong a, b, ⁎
Publikováno v:
In Linear Algebra and Its Applications 15 May 2024 689:108-125
Autor:
Yang Xiaojing, Xiong Liming
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 1, Pp 211-224 (2023)
Clearly, having a 2-factor in a graph is a necessary condition for a graph to be hamiltonian, while having an even factor in graph is a necessary condition for a graph to have a 2-factor. In this paper, we completely characterize the forbidden subgra
Externí odkaz:
https://doaj.org/article/1931d736310547c08eee637dfcb845d5