Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Hong-Gwa Yeh"'
Publikováno v:
Journal of Combinatorial Optimization. 31:815-832
In this paper, we use the connection between dynamic monopolies and feedback vertex sets to establish explicit formulas and new bounds for decycling number $$\nabla (G)$$?(G) when $$G$$G is one of the following classes of graphs: cycle permutation gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c1101dcca365fdc7c92950f9a9e80d8
https://doi.org/10.1007/s10878-014-9790-5
https://doi.org/10.1007/s10878-014-9790-5
Publikováno v:
SIAM Journal on Discrete Mathematics. 27:310-328
Let $G$ be a graph with a threshold function $\theta:V(G)\rightarrow \mathbb{N}$ such that $1\leq \theta(v)\leq d_G(v)$ for every vertex $v$ of $G$, where $d_G(v)$ is the degree of $v$ in $G$. Suppose we are given a target set $S\subseteq V(G)$. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6a965ee0a728a945d99143875fb88d5
https://doi.org/10.1137/120868864
https://doi.org/10.1137/120868864
Publikováno v:
Linear Algebra and its Applications. 434(8):1793-1798
The rank of a graph G is defined to be the rank of its adjacency matrix. In this paper, we consider the following problem: What is the structure of a connected graph with rank 4? This question has not yet been fully answered in the literature, and on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a5a2b4f4c5068701aaf20c778df34c7
Publikováno v:
Journal of Combinatorial Optimization. 24:266-279
A variation of the classical channel assignment problem is to assign a radio channel which is a nonnegative integer to each radio transmitter so that "close" transmitters must receive different channels and "very close" transmitters must receive chan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab45d74e3713423e630eaca0a8dd4a74
https://doi.org/10.1007/s10878-011-9380-8
https://doi.org/10.1007/s10878-011-9380-8
Publikováno v:
Linear Algebra and its Applications. 433(3):585-594
For a simple graph G on n vertices, the minimum rank of G over a field F , written as mr F ( G ) , is defined to be the smallest possible rank among all n × n symmetric matrices over F whose ( i , j ) th entry (for i ≠ j ) is nonzero whenever { i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f16e7e8fc7e4ee6d775df5d9923bea5a
Autor:
Hong-Gwa Yeh
Publikováno v:
Discrete Applied Mathematics. 157:1663-1668
We show that there is a curious connection between circular colorings of edge-weighted digraphs and periodic schedules of timed marked graphs. Circular coloring of an edge-weighted digraph was introduced by Mohar [B. Mohar, Circular colorings of edge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c041f7c7da33170987c26942b2c77bf6
https://doi.org/10.1016/j.dam.2008.10.003
https://doi.org/10.1016/j.dam.2008.10.003
Publikováno v:
Discrete Mathematics. 308:5298-5307
Let G be a connected graph and S a set of vertices of G. The Steiner distance of S is the smallest number of edges in a connected subgraph of G that contains S and is denoted by d"G(S) or d(S). The Steiner n-eccentricity e"n(v) and Steiner n-distance
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::882d7e958bf1d78c1eff768b6ffb1a10
https://doi.org/10.1016/j.disc.2007.08.094
https://doi.org/10.1016/j.disc.2007.08.094
Publikováno v:
Linear Algebra and its Applications. 429(2-3):601-605
The rank of a graph is defined to be the rank of its adjacency matrix. Royle [G.F. Royle, The rank of a cograph, Electron. J. Combin. 10 (2003) #N11] proved a somewhat surprising result that the rank of a cograph is equal to the number of distinct no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06b82947a8435f555dd12cd4563e2ffa
Autor:
Hong-Gwa Yeh, Mong Na Lo Huang
Publikováno v:
Metrika. 61:261-275
In this paper we consider the exact D-optimal designs for estimation of the unknown parameters in the two factors, each at only two-level, main effects model with autocorrelated errors. The vector of the n random errors in the observed responses is a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a64d766c3878ab795f2da9aba072eea
https://doi.org/10.1007/s001840400336
https://doi.org/10.1007/s001840400336
Publikováno v:
Discrete Mathematics. 256:441-444
The well-known theorem by Gallai–Roy–Vitaver says that every digraph G has a directed path with at least χ(G) vertices; hence this holds also for graphs. Li strengthened the digraph result by showing that the directed path can be constrained to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f501070886bb039a8bf19b401f2fabd
https://doi.org/10.1016/s0012-365x(02)00386-2
https://doi.org/10.1016/s0012-365x(02)00386-2