國立中央大學教師履歷平台

教師個人簡歷

回上一頁

葉鴻國

Yeh, Hong-Gwa

hgyeh@math.ncu.edu.tw

國科會計畫統計

圖型上格林函數與電阻距離的研究
1080801~1100731
[離散格林函數,代數圖論,圖譜理論,電阻距離,等效電阻,強正則圖,距離正則圖,拉普拉斯矩陣 , Discrete Green's function,algebraic graph theory,spectral graph theory,resistance distance,effective resistance,strongly regular graph,distance regular graph,combinatorial Laplacian matrix]
圖型上格林函數與電阻距離的研究
1070801~1080731
[離散格林函數,代數圖論,圖譜理論,電阻距離,等效電阻,強正則圖,距離正則圖,拉普拉斯矩陣 , Discrete Green's function,algebraic graph theory,spectral graph theory,resistance distance,effective resistance,strongly regular graph,distance regular graph,combinatorial Laplacian matrix]
圖型上格林函數與電阻距離的研究
1060801~1070731
[離散格林函數,代數圖論,圖譜理論,電阻距離,等效電阻,強正則圖,距離正則圖,拉普拉斯矩陣 , Discrete Green's function,algebraic graph theory,spectral graph theory,resistance distance,effective resistance,strongly regular graph,distance regular graph,combinatorial Laplacian matrix]
圖著色、圖譜與圖上擴散過程之研究
1050801~1060731
[著色數,圖的秩,目標集選擇問題,特徵值譜 , Graph, chromatic number, rank, target set selection problem, nullity, eigenvalue spectrum]
圖著色、圖譜與圖上擴散過程之研究
1040801~1050731
[著色數,圖的秩,目標集選擇問題,特徵值譜 , Graph, chromatic number, rank, target set selection problem, nullity, eigenvalue spectrum]

期刊著作

Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis
Journal of Combinatorial Optimization, 31, 2, 815-832, 2016-02-01
[ Dynamos , Feedback vertex set , Irreversible k-threshold , Social networks , Target set selection , Viral marketing ]
Target set selection problem for honeycomb networks
SIAM Journal on Discrete Mathematics, 27, 1, 310-328, 2013-05-06
[ Decycling , Dynamic monopolies , Feedback vertex set , Hexagonal grid , Honeycomb network , Irreversible spread of influence , Social networks , Strict majority threshold , Target set selection , Viral marketing ]
Some results on the target set selection problem
Journal of Combinatorial Optimization, 25, 4, 702-715, 2013-05-01
[ Block graph , Block-cactus graph , Chordal graph , Diffusion of innovations , Dynamic monopoly , Hamming graph , Irreversible spread of influence , Social networks , Target set selection , Tree , Viral marketing ]
On L(2, 1)-labeling of generalized Petersen graphs
Journal of Combinatorial Optimization, 24, 3, 266-279, 2012-10-01
[ λ-regular graph , ?-number , Channel assignment , Frequency allocation , Generalized Petersen graph , Interchannel interference , L(2, 1)-labeling , L(2, 1)-labeling number ]
A characterization of graphs with rank 5
Linear Algebra and Its Applications, 436, 11, 4241-4250, 2012-06-01
[ Adjacency matrix , Graph , Nullity , Rank , Spectrum ]
A characterization of graphs with rank 4
Linear Algebra and Its Applications, 434, 8, 1793-1798, 2011-04-15
[ Adjacency matrix , Graph , Nullity , Rank , Spectrum ]
A note on circular colorings of edge-weighted digraphs
Taiwanese Journal of Mathematics, 15, 5, 2159-2167, 2011-01-01
[ Circular chromatic number , Digraph ]
A note on universally optimal matrices and field independence of the minimum rank of a graph
Linear Algebra and Its Applications, 433, 3, 585-594, 2010-09-01
[ Field independent , Graph , Matrix , Maximum nullity , Minimum rank , Rank , Symmetric matrix , Universally optimal matrix ]
On minimum rank and zero forcing sets of a graph
Linear Algebra and Its Applications, 432, 11, 2961-2973, 2010-06-01
[ Block-clique graph , Maximum nullity , Minimum rank , Product graph , Rank , Symmetric matrix , Unit interval graph , Zero forcing set ]
A connection between circular colorings and periodic schedules
Discrete Applied Mathematics, 157, 7, 1663-1668, 2009-04-06
[ Circular chromatic number , Edge-weighted graph , Minty's theorem , Periodic scheduling , Timed marked graph ]
Steiner centers and Steiner medians of graphs
Discrete Mathematics, 308, 22, 5298-5307, 2008-11-28
[ Block graph , Steiner center , Steiner distance , Steiner median , Steiner n-distance , Steiner n-eccentricity ]
On the rank of a cograph
Linear Algebra and Its Applications, 429, 2-3, 601-605, 2008-07-15
[ Cograph , Complement reducible graph , Decomposable graph , Join , Rank , Twins , Union ]
A method to obtain lower bounds for circular chromatic number
Taiwanese Journal of Mathematics, 12, 4, 997-1005, 2008-01-01
[ Acyclic orientation , Circular chromatic number , Lower bounds , Period , Petersen graph , Sink , Source ]
On exact D-optimal designs with 2 two-level factors and n autocorrelated observations
Metrika, 61, 3, 261-275, 2005-06-01
[ AR(1) process , Autocorrelated observations , D-optimal design , Markov process , Two-level factor ]
Resource-sharing system scheduling and circular chromatic number
Theoretical Computer Science, 332, 1-3, 447-460, 2005-02-28
[ Circular chromatic number , Fairness , Fractional chromatic number , Homomorphism , Minimum mean cycle , Scheduling , Scheduling by edge reversal ]
4-Colorable 6-regular toroidal graphs
Discrete Mathematics, 273, 1-3, 261-274, 2003-12-11
[ Circulant graphs,Quadrangulations,Right diagonal shifted grids,Toroidal graphs,Triangulation ]
Centers and medians of distance-hereditary graphs
Discrete Mathematics, 265, 1-3, 297-310, 2003-04-06
[ Center , Chordal graph , Diameter , Distance , Distance-hereditary graph , Eccentricity , Median , Ptolemaic graph , Radius ]
A note on the Gallai-Roy-Vitaver Theorem
Discrete Mathematics, 256, 1-2, 441-444, 2002-09-28
[ Chromatic number , Coloring , K-Coloring , Path , Tournament ]
K-Subdomination in graphs
Discrete Applied Mathematics, 120, 1-3, 55-60, 2002-08-15
[ Domination , k-subdomination , Leaf , Majority domination , Signed domination , Tree ]
D-Disjunct matrices: Bounds and Lovâsz Local Lemma
Discrete Mathematics, 253, 1-3, 97-107, 2002-06-06
[ D-disjunct matrix , Group testing , Lovâsz local lemma , Probabilistic method , Stein-Chen approximation theorem ]
On the fractional chromatic number, the chromatic number, and graph products
Discrete Mathematics, 247, 1-3, 235-242, 2002-03-28
[ Chromatic number , Fractional chromatic number , Graph product , Uniquely colorable graph ]
Domination in distance-hereditary graphs
Discrete Applied Mathematics, 116, 1-2, 103-113, 2002-01-15
[ Distance-hereditary graph , Domination , Labeling , Leaf , Neighborhood , Twin ]
Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
Theoretical Computer Science, 263, 1-2, 3-8, 2001-08-14
[ Algorithm , Connected k-domination , Distance-hereditary graph , k-dominating clique ]
Weighted connected domination and Steiner trees in distance-hereditary graphs
Discrete Applied Mathematics, 87, 1-3, 245-253, 1998-10-05
[ Algorithm , Cograph , Connected domination , Distance-hereditary graph , Steiner tree ]
The path-partition problem in bipartite distance-hereditary graphs
Taiwanese Journal of Mathematics, 2, 3, 353-360, 1998-01-01
[ Distance-hereditary graph , Hamiltonian path , Path partition ]
A simple and direct derivation for the number of noncrossing partitions
Proceedings of the American Mathematical Society, 126, 6, 1579-1581, 1998-01-01
Sortabilities of Partition Properties
Journal of Combinatorial Optimization, 2, 4, 413-427, 1998-01-01
[ Consecutive partition , Nested partition , Order-consecutive partition , Partition ]
Algorithmic aspects of majority domination
Taiwanese Journal of Mathematics, 1, 3, 343-350, 1997-01-01
[ Cograph , Majority domination , Tree , κ-tree ]

研討會著作

Weighted connected domination and Steiner trees in distance-hereditary graphs
48-52, 1996-01-01

葉鴻國

Yeh, Hong-Gwa

現職

專長

專長簡述

最高學歷

相關連結

科技部學門領域

政府GRB研究專長領域

教育部學門領域

國科會計畫統計

圖著色、圖譜與圖上擴散過程之研究 1050801~1060731 [著色數,圖的秩,目標集選擇問題,特徵值譜 , Graph, chromatic number, rank, target set selection problem, nullity, eigenvalue spectrum]

圖著色、圖譜與圖上擴散過程之研究 1040801~1050731 [著色數,圖的秩,目標集選擇問題,特徵值譜 , Graph, chromatic number, rank, target set selection problem, nullity, eigenvalue spectrum]

期刊著作

On L(2, 1)-labeling of generalized Petersen graphs Journal of Combinatorial Optimization, 24, 3, 266-279, 2012-10-01 [ λ-regular graph , ?-number , Channel assignment , Frequency allocation , Generalized Petersen graph , Interchannel interference , L(2, 1)-labeling , L(2, 1)-labeling number ]

A characterization of graphs with rank 5 Linear Algebra and Its Applications, 436, 11, 4241-4250, 2012-06-01 [ Adjacency matrix , Graph , Nullity , Rank , Spectrum ]

A characterization of graphs with rank 4 Linear Algebra and Its Applications, 434, 8, 1793-1798, 2011-04-15 [ Adjacency matrix , Graph , Nullity , Rank , Spectrum ]

A note on circular colorings of edge-weighted digraphs Taiwanese Journal of Mathematics, 15, 5, 2159-2167, 2011-01-01 [ Circular chromatic number , Digraph ]

A note on universally optimal matrices and field independence of the minimum rank of a graph Linear Algebra and Its Applications, 433, 3, 585-594, 2010-09-01 [ Field independent , Graph , Matrix , Maximum nullity , Minimum rank , Rank , Symmetric matrix , Universally optimal matrix ]

On minimum rank and zero forcing sets of a graph Linear Algebra and Its Applications, 432, 11, 2961-2973, 2010-06-01 [ Block-clique graph , Maximum nullity , Minimum rank , Product graph , Rank , Symmetric matrix , Unit interval graph , Zero forcing set ]

A connection between circular colorings and periodic schedules Discrete Applied Mathematics, 157, 7, 1663-1668, 2009-04-06 [ Circular chromatic number , Edge-weighted graph , Minty's theorem , Periodic scheduling , Timed marked graph ]

Steiner centers and Steiner medians of graphs Discrete Mathematics, 308, 22, 5298-5307, 2008-11-28 [ Block graph , Steiner center , Steiner distance , Steiner median , Steiner n-distance , Steiner n-eccentricity ]

On the rank of a cograph Linear Algebra and Its Applications, 429, 2-3, 601-605, 2008-07-15 [ Cograph , Complement reducible graph , Decomposable graph , Join , Rank , Twins , Union ]

A method to obtain lower bounds for circular chromatic number Taiwanese Journal of Mathematics, 12, 4, 997-1005, 2008-01-01 [ Acyclic orientation , Circular chromatic number , Lower bounds , Period , Petersen graph , Sink , Source ]

On exact D-optimal designs with 2 two-level factors and n autocorrelated observations Metrika, 61, 3, 261-275, 2005-06-01 [ AR(1) process , Autocorrelated observations , D-optimal design , Markov process , Two-level factor ]

Resource-sharing system scheduling and circular chromatic number Theoretical Computer Science, 332, 1-3, 447-460, 2005-02-28 [ Circular chromatic number , Fairness , Fractional chromatic number , Homomorphism , Minimum mean cycle , Scheduling , Scheduling by edge reversal ]

4-Colorable 6-regular toroidal graphs Discrete Mathematics, 273, 1-3, 261-274, 2003-12-11 [ Circulant graphs,Quadrangulations,Right diagonal shifted grids,Toroidal graphs,Triangulation ]

Centers and medians of distance-hereditary graphs Discrete Mathematics, 265, 1-3, 297-310, 2003-04-06 [ Center , Chordal graph , Diameter , Distance , Distance-hereditary graph , Eccentricity , Median , Ptolemaic graph , Radius ]

A note on the Gallai-Roy-Vitaver Theorem Discrete Mathematics, 256, 1-2, 441-444, 2002-09-28 [ Chromatic number , Coloring , K-Coloring , Path , Tournament ]

K-Subdomination in graphs Discrete Applied Mathematics, 120, 1-3, 55-60, 2002-08-15 [ Domination , k-subdomination , Leaf , Majority domination , Signed domination , Tree ]

D-Disjunct matrices: Bounds and Lovâsz Local Lemma Discrete Mathematics, 253, 1-3, 97-107, 2002-06-06 [ D-disjunct matrix , Group testing , Lovâsz local lemma , Probabilistic method , Stein-Chen approximation theorem ]

On the fractional chromatic number, the chromatic number, and graph products Discrete Mathematics, 247, 1-3, 235-242, 2002-03-28 [ Chromatic number , Fractional chromatic number , Graph product , Uniquely colorable graph ]

Domination in distance-hereditary graphs Discrete Applied Mathematics, 116, 1-2, 103-113, 2002-01-15 [ Distance-hereditary graph , Domination , Labeling , Leaf , Neighborhood , Twin ]

Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs Theoretical Computer Science, 263, 1-2, 3-8, 2001-08-14 [ Algorithm , Connected k-domination , Distance-hereditary graph , k-dominating clique ]

Weighted connected domination and Steiner trees in distance-hereditary graphs Discrete Applied Mathematics, 87, 1-3, 245-253, 1998-10-05 [ Algorithm , Cograph , Connected domination , Distance-hereditary graph , Steiner tree ]

The path-partition problem in bipartite distance-hereditary graphs Taiwanese Journal of Mathematics, 2, 3, 353-360, 1998-01-01 [ Distance-hereditary graph , Hamiltonian path , Path partition ]

A simple and direct derivation for the number of noncrossing partitions Proceedings of the American Mathematical Society, 126, 6, 1579-1581, 1998-01-01

Sortabilities of Partition Properties Journal of Combinatorial Optimization, 2, 4, 413-427, 1998-01-01 [ Consecutive partition , Nested partition , Order-consecutive partition , Partition ]

Algorithmic aspects of majority domination Taiwanese Journal of Mathematics, 1, 3, 343-350, 1997-01-01 [ Cograph , Majority domination , Tree , κ-tree ]

研討會著作

Weighted connected domination and Steiner trees in distance-hereditary graphs 48-52, 1996-01-01

圖著色、圖譜與圖上擴散過程之研究
1050801~1060731
[著色數,圖的秩,目標集選擇問題,特徵值譜 , Graph, chromatic number, rank, target set selection problem, nullity, eigenvalue spectrum]

圖著色、圖譜與圖上擴散過程之研究
1040801~1050731
[著色數,圖的秩,目標集選擇問題,特徵值譜 , Graph, chromatic number, rank, target set selection problem, nullity, eigenvalue spectrum]

On L(2, 1)-labeling of generalized Petersen graphs
Journal of Combinatorial Optimization, 24, 3, 266-279, 2012-10-01
[ λ-regular graph , ?-number , Channel assignment , Frequency allocation , Generalized Petersen graph , Interchannel interference , L(2, 1)-labeling , L(2, 1)-labeling number ]

A characterization of graphs with rank 5
Linear Algebra and Its Applications, 436, 11, 4241-4250, 2012-06-01
[ Adjacency matrix , Graph , Nullity , Rank , Spectrum ]

A characterization of graphs with rank 4
Linear Algebra and Its Applications, 434, 8, 1793-1798, 2011-04-15
[ Adjacency matrix , Graph , Nullity , Rank , Spectrum ]

A note on circular colorings of edge-weighted digraphs
Taiwanese Journal of Mathematics, 15, 5, 2159-2167, 2011-01-01
[ Circular chromatic number , Digraph ]

A note on universally optimal matrices and field independence of the minimum rank of a graph
Linear Algebra and Its Applications, 433, 3, 585-594, 2010-09-01
[ Field independent , Graph , Matrix , Maximum nullity , Minimum rank , Rank , Symmetric matrix , Universally optimal matrix ]

On minimum rank and zero forcing sets of a graph
Linear Algebra and Its Applications, 432, 11, 2961-2973, 2010-06-01
[ Block-clique graph , Maximum nullity , Minimum rank , Product graph , Rank , Symmetric matrix , Unit interval graph , Zero forcing set ]

A connection between circular colorings and periodic schedules
Discrete Applied Mathematics, 157, 7, 1663-1668, 2009-04-06
[ Circular chromatic number , Edge-weighted graph , Minty's theorem , Periodic scheduling , Timed marked graph ]

Steiner centers and Steiner medians of graphs
Discrete Mathematics, 308, 22, 5298-5307, 2008-11-28
[ Block graph , Steiner center , Steiner distance , Steiner median , Steiner n-distance , Steiner n-eccentricity ]

On the rank of a cograph
Linear Algebra and Its Applications, 429, 2-3, 601-605, 2008-07-15
[ Cograph , Complement reducible graph , Decomposable graph , Join , Rank , Twins , Union ]

A method to obtain lower bounds for circular chromatic number
Taiwanese Journal of Mathematics, 12, 4, 997-1005, 2008-01-01
[ Acyclic orientation , Circular chromatic number , Lower bounds , Period , Petersen graph , Sink , Source ]

On exact D-optimal designs with 2 two-level factors and n autocorrelated observations
Metrika, 61, 3, 261-275, 2005-06-01
[ AR(1) process , Autocorrelated observations , D-optimal design , Markov process , Two-level factor ]

Resource-sharing system scheduling and circular chromatic number
Theoretical Computer Science, 332, 1-3, 447-460, 2005-02-28
[ Circular chromatic number , Fairness , Fractional chromatic number , Homomorphism , Minimum mean cycle , Scheduling , Scheduling by edge reversal ]

4-Colorable 6-regular toroidal graphs
Discrete Mathematics, 273, 1-3, 261-274, 2003-12-11
[ Circulant graphs,Quadrangulations,Right diagonal shifted grids,Toroidal graphs,Triangulation ]

Centers and medians of distance-hereditary graphs
Discrete Mathematics, 265, 1-3, 297-310, 2003-04-06
[ Center , Chordal graph , Diameter , Distance , Distance-hereditary graph , Eccentricity , Median , Ptolemaic graph , Radius ]

A note on the Gallai-Roy-Vitaver Theorem
Discrete Mathematics, 256, 1-2, 441-444, 2002-09-28
[ Chromatic number , Coloring , K-Coloring , Path , Tournament ]

K-Subdomination in graphs
Discrete Applied Mathematics, 120, 1-3, 55-60, 2002-08-15
[ Domination , k-subdomination , Leaf , Majority domination , Signed domination , Tree ]

D-Disjunct matrices: Bounds and Lovâsz Local Lemma
Discrete Mathematics, 253, 1-3, 97-107, 2002-06-06
[ D-disjunct matrix , Group testing , Lovâsz local lemma , Probabilistic method , Stein-Chen approximation theorem ]

On the fractional chromatic number, the chromatic number, and graph products
Discrete Mathematics, 247, 1-3, 235-242, 2002-03-28
[ Chromatic number , Fractional chromatic number , Graph product , Uniquely colorable graph ]

Domination in distance-hereditary graphs
Discrete Applied Mathematics, 116, 1-2, 103-113, 2002-01-15
[ Distance-hereditary graph , Domination , Labeling , Leaf , Neighborhood , Twin ]

Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
Theoretical Computer Science, 263, 1-2, 3-8, 2001-08-14
[ Algorithm , Connected k-domination , Distance-hereditary graph , k-dominating clique ]

Weighted connected domination and Steiner trees in distance-hereditary graphs
Discrete Applied Mathematics, 87, 1-3, 245-253, 1998-10-05
[ Algorithm , Cograph , Connected domination , Distance-hereditary graph , Steiner tree ]

The path-partition problem in bipartite distance-hereditary graphs
Taiwanese Journal of Mathematics, 2, 3, 353-360, 1998-01-01
[ Distance-hereditary graph , Hamiltonian path , Path partition ]

A simple and direct derivation for the number of noncrossing partitions
Proceedings of the American Mathematical Society, 126, 6, 1579-1581, 1998-01-01

Sortabilities of Partition Properties
Journal of Combinatorial Optimization, 2, 4, 413-427, 1998-01-01
[ Consecutive partition , Nested partition , Order-consecutive partition , Partition ]

Algorithmic aspects of majority domination
Taiwanese Journal of Mathematics, 1, 3, 343-350, 1997-01-01
[ Cograph , Majority domination , Tree , κ-tree ]

Weighted connected domination and Steiner trees in distance-hereditary graphs
48-52, 1996-01-01