Zobrazeno 1 - 10
of 187
pro vyhledávání: '"Hajo Broersma"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 2, p 717 (2024)
Externí odkaz:
https://doaj.org/article/f6ba8f145a4d478b92f0ab7753dd635b
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 433-441 (2021)
Let ω(G) denote the number of components of a graph G. A connected graph G is said to be 1-tough if ω(G − X)≤|X| for all X ⊆ V(G) with ω(G − X)>1. It is well-known that every hamiltonian graph is 1-tough, but that the reverse statement is
Externí odkaz:
https://doaj.org/article/b9008e7796564eafbf8314a947291779
Publikováno v:
Axioms, Vol 11, Iss 5, p 243 (2022)
Let G be a (molecular) graph with n vertices, and di be the degree of its i-th vertex. Then, the inverse sum indeg matrix of G is the n×n matrix C(G) with entries cij=didjdi+dj, if the i-th and the j-th vertices are adjacent and 0 otherwise. Let μ1
Externí odkaz:
https://doaj.org/article/f20f733083304c3babab014fe22f7012
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 2, Iss 2, Pp 110-114 (2014)
Given two graphs G1 and G2, the Ramsey number R(G1;G2)is the smallest integer N such that, for any graph G of order N, either G1 is a subgraph of G, or G2 is a subgraph of the complement of G. Let Cn denote a cycle of order n, Wn a wheel of order n+1
Externí odkaz:
https://doaj.org/article/33ddfd065ccf49318711b91e36c800d3
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 1, Iss 1, Pp 1-10 (2013)
A block-chain is a graph whose block graph is a path, i.e. it is either a $P_1$, a $P_2$, or a 2-connected graph, or a graph of connectivity 1 with exactly two end-blocks. A graph is called traceable if it contains a Hamilton path. A traceable graph
Externí odkaz:
https://doaj.org/article/880abfa84eab4da0a28e8719507ef358
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no. 3, Iss Discrete Algorithms (2016)
Network models allow one to deal with massive data sets using some standard concepts from graph theory. Understanding and investigating the structural properties of a certain data set is a crucial task in many practical applications of network optimi
Externí odkaz:
https://doaj.org/article/7d5cba4182a34e408b395c1072486d8d
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 3, Iss 2 (2015)
In this paper we introduce and study a directed tree problem motivated by a new graph product that we have recently introduced and analysed in two conference contributions in the context of periodic real-time processes. While the two conference paper
Externí odkaz:
https://doaj.org/article/096aa3644df545f6b9fabf0b164a18bc
Publikováno v:
Discrete Applied Mathematics. 327:101-109
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f688a8c59485595bd342bd1716818577
https://doi.org/10.1016/j.dam.2022.12.020
https://doi.org/10.1016/j.dam.2022.12.020
Autor:
WEI ZHENG1,2 zhengweimath@163.com, HAJO BROERSMA2 h.j.broersma@utwente.nl, LIGONG WANG1 lgwangmath@163.com
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2022, Vol. 42 Issue 1, p187-196. 10p.
Publikováno v:
Linear algebra and its applications, 653, 320-338. Elsevier
A mixed graph is a graph that can be obtained from a simple undirected graph by replacing some of the edges by arcs in precisely one of the two possible directions. The Hermitian adjacency matrix of a mixed graph G of order n is the n×n matrix H(G)=
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04376b66d37f951ab71b33b36db35539
https://doi.org/10.1016/j.laa.2022.08.019
https://doi.org/10.1016/j.laa.2022.08.019