Wszystkie pola: CAI - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Nonsingular unicyclic mixed graphs with at most three eigenvalues greater than two
Autorzy:: Gong, Shi-Cai
Fan, Yi-Zheng
Powiązania:: https://bibliotekanauki.pl/articles/743659.pdf
Data publikacji:: 2007
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: unicyclic graph
mixed graph
Laplacian eigenvalue
matching number
spectrum
Opis:: This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most three Laplacian eigenvalues greater than two.
Źródło:: Discussiones Mathematicae Graph Theory; 2007, 27, 1; 69-82
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: An implicit weighted degree condition for heavy cycles
Autorzy:: Cai, Junqing
Li, Hao
Ning, Wantao
Powiązania:: https://bibliotekanauki.pl/articles/30148719.pdf
Data publikacji:: 2014-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: weighted graph
hamiltonian cycles
heavy cycles
implicit degree
implicit weighted degree
Opis:: For a vertex v in a weighted graph G, id^w(v) denotes the implicit weighted degree of v. In this paper, we obtain the following result: Let G be a 2-connected weighted graph which satisfies the following conditions: (a) The implicit weighted degree sum of any three independent vertices is at least t; (b) w(xz) = w(yz) for every vertex z ∈ N(x) ∩ N(y) with xy /∈ E(G); (c) In every triangle T of G, either all edges of T have different weights or all edges of T have the same weight. Then G contains either a hamiltonian cycle or a cycle of weight at least 2t/3. This generalizes the result of Zhang et al. [9].
Źródło:: Discussiones Mathematicae Graph Theory; 2014, 34, 4; 801-810
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: The Crossing Number of Hexagonal Graph H_3,n in the Projective Plane
Autorzy:: Wang, Jing
Cai, Junliang
Lv, Shengxiang
Huang, Yuanqiu
Powiązania:: https://bibliotekanauki.pl/articles/32361743.pdf
Data publikacji:: 2022-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: projective plane
crossing number
hexagonal graph
drawing
Opis:: Thomassen described all (except finitely many) regular tilings of the torus $ S_1 $ and the Klein bottle $N_2$ into (3,6)-tilings, (4,4)-tilings and (6,3)-tilings. Many researchers made great efforts to investigate the crossing number of the Cartesian product of an $m$-cycle and an $n$-cycle, which is a special kind of (4,4)-tilings, either in the plane or in the projective plane. In this paper we study the crossing number of the hexagonal graph $ H_{3,n} (n \ge 2) $, which is a special kind of (3,6)-tilings, in the projective plane, and prove that $$ cr_{N_1} (H_{3,n}) = \begin{cases} 0, & n=2, \\ n-1, & n \ge 3. \end{cases} $$
Źródło:: Discussiones Mathematicae Graph Theory; 2022, 42, 1; 197-218
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Spectral Radius and Hamiltonicity of Graphs
Autorzy:: Yu, Guidong
Fang, Yi
Fan, Yizheng
Cai, Gaixiang
Powiązania:: https://bibliotekanauki.pl/articles/31343181.pdf
Data publikacji:: 2019-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: spectral radius
singless Laplacian spectral radius
traceable
Hamiltonian-connected
traceable from every vertex
minimum degree
Opis:: In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or its complement, respectively. Secondly, we give the conditions for a nearly balanced bipartite graph to be traceable in terms of spectral radius, signless Laplacian spectral radius of the graph or its quasi-complement, respectively.
Źródło:: Discussiones Mathematicae Graph Theory; 2019, 39, 4; 951-974
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja