Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `+publisher:"NSYSU" +contributor:("Xuding Zhu")`

.
Showing records 1 – 30 of
35 total matches.

Search Limiters

Dates

- 2007 – 2011 (10)
- 2002 – 2006 (19)

▼ Search Limiters

NSYSU

1. Lin, Chien-Ru. Ambarzumyan problem on trees.

Degree: Master, Applied Mathematics, 2008, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0723108-112710

► We study the Ambarzumyan problem for Sturm-Liouville operator defined on graph. The classical Ambarzumyan Theorem states that if the Neumann eigenvalues of the Sturm-Liouville operator…
(more)

Subjects/Keywords: Ambarzumyan problem; Sturm-Liouville operator; Dirichlet boundary problem; Neumann boundary problem; Tree

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lin, C. (2008). Ambarzumyan problem on trees. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0723108-112710

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Lin, Chien-Ru. “Ambarzumyan problem on trees.” 2008. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0723108-112710.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lin, Chien-Ru. “Ambarzumyan problem on trees.” 2008. Web. 09 May 2021.

Vancouver:

Lin C. Ambarzumyan problem on trees. [Internet] [Thesis]. NSYSU; 2008. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0723108-112710.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lin C. Ambarzumyan problem on trees. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0723108-112710

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

2. Chang, Chia-Jung. Triangle-free subcubic graphs with small bipartite density.

Degree: Master, Applied Mathematics, 2008, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0620108-164144

► Suppose G is a graph with n vertices and m edges. Let nâ² be the maximum number of vertices in an induced bipartite subgraph of…
(more)

Subjects/Keywords: planar graph; triangle-free; subcubic; bipartite density; bipartite ratio

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Chang, C. (2008). Triangle-free subcubic graphs with small bipartite density. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0620108-164144

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Chang, Chia-Jung. “Triangle-free subcubic graphs with small bipartite density.” 2008. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0620108-164144.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chang, Chia-Jung. “Triangle-free subcubic graphs with small bipartite density.” 2008. Web. 09 May 2021.

Vancouver:

Chang C. Triangle-free subcubic graphs with small bipartite density. [Internet] [Thesis]. NSYSU; 2008. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0620108-164144.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chang C. Triangle-free subcubic graphs with small bipartite density. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0620108-164144

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

3. Wang, Wen. Domination number of Cartesian product of graphs.

Degree: Master, Applied Mathematics, 2013, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0726113-171827

► For a graph G, (G) is the domination number of G. Vizing [2] conjectured that gamma(G Box H) >= gamma(G)gamma(H) for any graph G and…
(more)

Subjects/Keywords: domination number; Cartesian Product; Vizing Conjecture

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Wang, W. (2013). Domination number of Cartesian product of graphs. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0726113-171827

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wang, Wen. “Domination number of Cartesian product of graphs.” 2013. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0726113-171827.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wang, Wen. “Domination number of Cartesian product of graphs.” 2013. Web. 09 May 2021.

Vancouver:

Wang W. Domination number of Cartesian product of graphs. [Internet] [Thesis]. NSYSU; 2013. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0726113-171827.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang W. Domination number of Cartesian product of graphs. [Thesis]. NSYSU; 2013. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0726113-171827

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

4. Su, Fang-Mei. Contour sets in product graphs.

Degree: Master, Applied Mathematics, 2009, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0722109-133037

► For a vertex x of G, the eccentricity e (x) is the distance between x and a vertex farthest from x. Then x is a…
(more)

Subjects/Keywords: geodesic; geodetic; eccentricity; contour vertex

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Su, F. (2009). Contour sets in product graphs. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0722109-133037

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Su, Fang-Mei. “Contour sets in product graphs.” 2009. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0722109-133037.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Su, Fang-Mei. “Contour sets in product graphs.” 2009. Web. 09 May 2021.

Vancouver:

Su F. Contour sets in product graphs. [Internet] [Thesis]. NSYSU; 2009. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0722109-133037.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Su F. Contour sets in product graphs. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0722109-133037

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

5. Liu, Jin-yu. The game Grundy arboricity of graphs.

Degree: Master, Applied Mathematics, 2012, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831112-124813

► Given a graph G = (V, E), two players, Alice and Bob, alternate their turns to choose uncolored edges to be colored. Whenever an uncolored…
(more)

Subjects/Keywords: arboricity; game Grundy arboricity; outerplanar graph; coloring game; acyclic orientation

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Liu, J. (2012). The game Grundy arboricity of graphs. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831112-124813

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Liu, Jin-yu. “The game Grundy arboricity of graphs.” 2012. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831112-124813.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liu, Jin-yu. “The game Grundy arboricity of graphs.” 2012. Web. 09 May 2021.

Vancouver:

Liu J. The game Grundy arboricity of graphs. [Internet] [Thesis]. NSYSU; 2012. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831112-124813.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu J. The game Grundy arboricity of graphs. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831112-124813

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

6. Yang, Chung-Ying. Colouring, circular list colouring and adapted game colouring of graphs.

Degree: PhD, Applied Mathematics, 2010, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727110-000414

► This thesis discusses colouring, circular list colouring and adapted game colouring of graphs. For colouring, this thesis obtains a sufficient condition for a planar graph…
(more)

Subjects/Keywords: Cartesian product; chromatic number; adapted game chromatic number; game chromatic number; circular consecutive choosability; adapted; consecutive choosability; partial k-tree; circular chromatic number; planar; 3-colouring; circular choosability

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Yang, C. (2010). Colouring, circular list colouring and adapted game colouring of graphs. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727110-000414

Chicago Manual of Style (16^{th} Edition):

Yang, Chung-Ying. “Colouring, circular list colouring and adapted game colouring of graphs.” 2010. Doctoral Dissertation, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727110-000414.

MLA Handbook (7^{th} Edition):

Yang, Chung-Ying. “Colouring, circular list colouring and adapted game colouring of graphs.” 2010. Web. 09 May 2021.

Vancouver:

Yang C. Colouring, circular list colouring and adapted game colouring of graphs. [Internet] [Doctoral dissertation]. NSYSU; 2010. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727110-000414.

Council of Science Editors:

Yang C. Colouring, circular list colouring and adapted game colouring of graphs. [Doctoral Dissertation]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727110-000414

NSYSU

7. Chang, Ting-pang. The hamiltonian numbers of graphs and digraphs.

Degree: PhD, Applied Mathematics, 2011, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0124111-164137

► The hamiltonian number problem is a generalization of hamiltonian cycle problem in graph theory. It is well known that the hamiltonian cycle problem in graph…
(more)

Subjects/Keywords: hamiltonian number; hamiltonian cycle; double loop network

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Chang, T. (2011). The hamiltonian numbers of graphs and digraphs. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0124111-164137

Chicago Manual of Style (16^{th} Edition):

Chang, Ting-pang. “The hamiltonian numbers of graphs and digraphs.” 2011. Doctoral Dissertation, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0124111-164137.

MLA Handbook (7^{th} Edition):

Chang, Ting-pang. “The hamiltonian numbers of graphs and digraphs.” 2011. Web. 09 May 2021.

Vancouver:

Chang T. The hamiltonian numbers of graphs and digraphs. [Internet] [Doctoral dissertation]. NSYSU; 2011. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0124111-164137.

Council of Science Editors:

Chang T. The hamiltonian numbers of graphs and digraphs. [Doctoral Dissertation]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0124111-164137

NSYSU

8. Yen, Pei-Lan. A study of convexity in directed graphs.

Degree: PhD, Applied Mathematics, 2011, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0127111-064740

► Convexity in graphs has been widely discussed in graph theory and G. Chartrand et al. introduced the convexity number of oriented graphs in 2002. In…
(more)

Subjects/Keywords: convexity spectrum ratio; difference of convexity spectra; strong convexity spectrum; convexity spectrum; convex set; orientable convexity number; convexity number

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Yen, P. (2011). A study of convexity in directed graphs. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0127111-064740

Chicago Manual of Style (16^{th} Edition):

Yen, Pei-Lan. “A study of convexity in directed graphs.” 2011. Doctoral Dissertation, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0127111-064740.

MLA Handbook (7^{th} Edition):

Yen, Pei-Lan. “A study of convexity in directed graphs.” 2011. Web. 09 May 2021.

Vancouver:

Yen P. A study of convexity in directed graphs. [Internet] [Doctoral dissertation]. NSYSU; 2011. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0127111-064740.

Council of Science Editors:

Yen P. A study of convexity in directed graphs. [Doctoral Dissertation]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0127111-064740

NSYSU

9. Liang, Yu-Chang. Anti-magic labeling of graphs.

Degree: PhD, Applied Mathematics, 2014, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0010114-155910

► An antimagic labeling of a graph G is a one-to-one correspondence between E(G) and {1, 2, . . . , |E|} such that for any…
(more)

Subjects/Keywords: regular graph; tree; anti-magic; Cartesian product graph

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Liang, Y. (2014). Anti-magic labeling of graphs. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0010114-155910

Chicago Manual of Style (16^{th} Edition):

Liang, Yu-Chang. “Anti-magic labeling of graphs.” 2014. Doctoral Dissertation, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0010114-155910.

MLA Handbook (7^{th} Edition):

Liang, Yu-Chang. “Anti-magic labeling of graphs.” 2014. Web. 09 May 2021.

Vancouver:

Liang Y. Anti-magic labeling of graphs. [Internet] [Doctoral dissertation]. NSYSU; 2014. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0010114-155910.

Council of Science Editors:

Liang Y. Anti-magic labeling of graphs. [Doctoral Dissertation]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0010114-155910

NSYSU

10. Lin, Che-Yu. The circular chromatic numbers of line graphs and total graphs.

Degree: PhD, Applied Mathematics, 2014, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0014114-151402

► A circular r-colouring of a graph G is a mapping c : V (G) â [0, r) such that for any two adjacent vertices x…
(more)

Subjects/Keywords: line graph; circular colouring; circular chromatic index; circular total chromatic number; total graph

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lin, C. (2014). The circular chromatic numbers of line graphs and total graphs. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0014114-151402

Chicago Manual of Style (16^{th} Edition):

Lin, Che-Yu. “The circular chromatic numbers of line graphs and total graphs.” 2014. Doctoral Dissertation, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0014114-151402.

MLA Handbook (7^{th} Edition):

Lin, Che-Yu. “The circular chromatic numbers of line graphs and total graphs.” 2014. Web. 09 May 2021.

Vancouver:

Lin C. The circular chromatic numbers of line graphs and total graphs. [Internet] [Doctoral dissertation]. NSYSU; 2014. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0014114-151402.

Council of Science Editors:

Lin C. The circular chromatic numbers of line graphs and total graphs. [Doctoral Dissertation]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0014114-151402

NSYSU

11. Roussel, Nicolas. Circular colorings and acyclic choosability of graphs.

Degree: PhD, Applied Mathematics, 2009, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1223109-135602

► This thesis studies five kinds of graph colorings: the circular coloring, the total coloring, the (d; 1)-total labeling, the circular (r; 1)-total labeling, and the…
(more)

Subjects/Keywords: Circular coloring; total coloring; missing cycles; maximum average degree; planar graphs; acyclic choosability; circular (r; 1)-total labeling; (d; 1)-total labeling

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Roussel, N. (2009). Circular colorings and acyclic choosability of graphs. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1223109-135602

Chicago Manual of Style (16^{th} Edition):

Roussel, Nicolas. “Circular colorings and acyclic choosability of graphs.” 2009. Doctoral Dissertation, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1223109-135602.

MLA Handbook (7^{th} Edition):

Roussel, Nicolas. “Circular colorings and acyclic choosability of graphs.” 2009. Web. 09 May 2021.

Vancouver:

Roussel N. Circular colorings and acyclic choosability of graphs. [Internet] [Doctoral dissertation]. NSYSU; 2009. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1223109-135602.

Council of Science Editors:

Roussel N. Circular colorings and acyclic choosability of graphs. [Doctoral Dissertation]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-1223109-135602

NSYSU

12. Jhan, Wen-min. Circular chromatic indexes of generalized necklaces.

Degree: Master, Applied Mathematics, 2005, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715105-004218

► Suppose G is a graph and e=ab is an edge of G. For a positive integer k, the G-necklace of length k (with respect to…
(more)

Subjects/Keywords: necklaces; circular chromatic index

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Jhan, W. (2005). Circular chromatic indexes of generalized necklaces. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715105-004218

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Jhan, Wen-min. “Circular chromatic indexes of generalized necklaces.” 2005. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715105-004218.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Jhan, Wen-min. “Circular chromatic indexes of generalized necklaces.” 2005. Web. 09 May 2021.

Vancouver:

Jhan W. Circular chromatic indexes of generalized necklaces. [Internet] [Thesis]. NSYSU; 2005. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715105-004218.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jhan W. Circular chromatic indexes of generalized necklaces. [Thesis]. NSYSU; 2005. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715105-004218

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

13. Tu, Sheng-hsien. Star extremal of circulant graphs.

Degree: Master, Applied Mathematics, 2004, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0609104-223209

► A graph is called star extremal if its fractional chromatic number is equal to its circular chromatic number. Given integers n,k,k' such that 1<=k<=k'<=n/2,the circulant…
(more)

Subjects/Keywords: star extremal; circulant graph

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Tu, S. (2004). Star extremal of circulant graphs. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0609104-223209

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Tu, Sheng-hsien. “Star extremal of circulant graphs.” 2004. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0609104-223209.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tu, Sheng-hsien. “Star extremal of circulant graphs.” 2004. Web. 09 May 2021.

Vancouver:

Tu S. Star extremal of circulant graphs. [Internet] [Thesis]. NSYSU; 2004. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0609104-223209.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tu S. Star extremal of circulant graphs. [Thesis]. NSYSU; 2004. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0609104-223209

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

14. Li, fu-qun. Chromatic number of integral distance graph.

Degree: Master, Applied Mathematics, 2001, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0213101-134241

► Abstract For a set D of positive integers, the integral distance graph G(Z, D) is the graph with vertex set Z and edge set {…
(more)

Subjects/Keywords: integral distance graph; Chromatic number.

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Li, f. (2001). Chromatic number of integral distance graph. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0213101-134241

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Li, fu-qun. “Chromatic number of integral distance graph.” 2001. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0213101-134241.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Li, fu-qun. “Chromatic number of integral distance graph.” 2001. Web. 09 May 2021.

Vancouver:

Li f. Chromatic number of integral distance graph. [Internet] [Thesis]. NSYSU; 2001. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0213101-134241.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li f. Chromatic number of integral distance graph. [Thesis]. NSYSU; 2001. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0213101-134241

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

15. Wu, Jiao-Jiao. Game chromatic number of Halin graphs.

Degree: Master, Applied Mathematics, 2001, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627101-110358

This thesis discusses the game chromatic number of Halin graphs. We shall
prove that with a few exceptions, all Halin graphs have game chromatic
number 4.
*Advisors/Committee Members: D. J. Guan (chair), Hong-Gwa Yeh (chair), Tsai-Lien Wong (chair), Xuding Zhu (committee member).*

Subjects/Keywords: Game chromatic number; Halin graphs

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Wu, J. (2001). Game chromatic number of Halin graphs. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627101-110358

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wu, Jiao-Jiao. “Game chromatic number of Halin graphs.” 2001. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627101-110358.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wu, Jiao-Jiao. “Game chromatic number of Halin graphs.” 2001. Web. 09 May 2021.

Vancouver:

Wu J. Game chromatic number of Halin graphs. [Internet] [Thesis]. NSYSU; 2001. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627101-110358.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wu J. Game chromatic number of Halin graphs. [Thesis]. NSYSU; 2001. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627101-110358

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

16. Huang, Shi-Hang. Fault Tolerant Message Routing Algorithm on Double-Loop Networks.

Degree: Master, Applied Mathematics, 2002, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0617102-114620

► Message routing is a fundamental function of a network, and fault-tolerance is an important tool to ensure the quality of service of a network. Assume…
(more)

Subjects/Keywords: duuble-loop network; fault tolerant routing; second optimal path

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Huang, S. (2002). Fault Tolerant Message Routing Algorithm on Double-Loop Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0617102-114620

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Huang, Shi-Hang. “Fault Tolerant Message Routing Algorithm on Double-Loop Networks.” 2002. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0617102-114620.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Huang, Shi-Hang. “Fault Tolerant Message Routing Algorithm on Double-Loop Networks.” 2002. Web. 09 May 2021.

Vancouver:

Huang S. Fault Tolerant Message Routing Algorithm on Double-Loop Networks. [Internet] [Thesis]. NSYSU; 2002. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0617102-114620.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang S. Fault Tolerant Message Routing Algorithm on Double-Loop Networks. [Thesis]. NSYSU; 2002. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0617102-114620

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

17. Li, Yun-Ruei. The Multicast Rearrangeability of Banyan-type Networks.

Degree: Master, Applied Mathematics, 2006, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728106-144313

► In the thesis, we study the f-cast rearrangeability of the Banyan-type network with crosstalk constraint. Let n, j, x and c be nonnegative integers with…
(more)

Subjects/Keywords: rearrangeability; multicast

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Li, Y. (2006). The Multicast Rearrangeability of Banyan-type Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728106-144313

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Li, Yun-Ruei. “The Multicast Rearrangeability of Banyan-type Networks.” 2006. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728106-144313.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Li, Yun-Ruei. “The Multicast Rearrangeability of Banyan-type Networks.” 2006. Web. 09 May 2021.

Vancouver:

Li Y. The Multicast Rearrangeability of Banyan-type Networks. [Internet] [Thesis]. NSYSU; 2006. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728106-144313.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li Y. The Multicast Rearrangeability of Banyan-type Networks. [Thesis]. NSYSU; 2006. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728106-144313

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

18. Tang, Hsiu-mien. The complete subgraphs of some graphs induced by rings.

Degree: Master, Applied Mathematics, 2007, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0801107-052134

► We consider complete subgraphs of the graph induced by the noncommutativity of a ring, and prove that the graph induced by an infinite noncommutative prime…
(more)

Subjects/Keywords: perfect graph; complete subgraph; prime ring; semiprime ring

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Tang, H. (2007). The complete subgraphs of some graphs induced by rings. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0801107-052134

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Tang, Hsiu-mien. “The complete subgraphs of some graphs induced by rings.” 2007. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0801107-052134.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tang, Hsiu-mien. “The complete subgraphs of some graphs induced by rings.” 2007. Web. 09 May 2021.

Vancouver:

Tang H. The complete subgraphs of some graphs induced by rings. [Internet] [Thesis]. NSYSU; 2007. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0801107-052134.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tang H. The complete subgraphs of some graphs induced by rings. [Thesis]. NSYSU; 2007. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0801107-052134

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

19. Gao, Ying-Yao. Minimum Diameter Double-Loop Networks.

Degree: Master, Computer Science and Engineering, 2002, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721102-205330

► Abstract ããDouble-loop networks have become one of the most popular architectures in the design of Local Area Networks and distributed memory multiprocessor systems. This is…
(more)

Subjects/Keywords: lower bound lb(N); double-loop networks; optimal topology; diameter

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Gao, Y. (2002). Minimum Diameter Double-Loop Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721102-205330

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Gao, Ying-Yao. “Minimum Diameter Double-Loop Networks.” 2002. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721102-205330.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gao, Ying-Yao. “Minimum Diameter Double-Loop Networks.” 2002. Web. 09 May 2021.

Vancouver:

Gao Y. Minimum Diameter Double-Loop Networks. [Internet] [Thesis]. NSYSU; 2002. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721102-205330.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gao Y. Minimum Diameter Double-Loop Networks. [Thesis]. NSYSU; 2002. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721102-205330

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

20. Luo, Rebecca. Jordan and Lie homomorphism and derivation on prime ring.

Degree: Master, Applied Mathematics, 2002, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0821102-111717

► We will discuss some properties of Jordan and Lie homomorphisms and derivations on prime rings. We first give some definitions and then we show some…
(more)

Subjects/Keywords: homomorphisms; derivations; Jordan and Lie

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Luo, R. (2002). Jordan and Lie homomorphism and derivation on prime ring. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0821102-111717

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Luo, Rebecca. “Jordan and Lie homomorphism and derivation on prime ring.” 2002. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0821102-111717.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Luo, Rebecca. “Jordan and Lie homomorphism and derivation on prime ring.” 2002. Web. 09 May 2021.

Vancouver:

Luo R. Jordan and Lie homomorphism and derivation on prime ring. [Internet] [Thesis]. NSYSU; 2002. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0821102-111717.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Luo R. Jordan and Lie homomorphism and derivation on prime ring. [Thesis]. NSYSU; 2002. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0821102-111717

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

21. Wu, Shin-Huei. Finding Tree t-spanners on Interval, Permutation and Trapezoid Graphs.

Degree: Master, Computer Science and Engineering, 2002, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0826102-160304

► A t-spanner of a graph G is a subgraph H of G, which the distance between any two vertices in H is at most t…
(more)

Subjects/Keywords: permutation graphs; interval graphs; trapezoid graphs; t-spanner

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Wu, S. (2002). Finding Tree t-spanners on Interval, Permutation and Trapezoid Graphs. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0826102-160304

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wu, Shin-Huei. “Finding Tree t-spanners on Interval, Permutation and Trapezoid Graphs.” 2002. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0826102-160304.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wu, Shin-Huei. “Finding Tree t-spanners on Interval, Permutation and Trapezoid Graphs.” 2002. Web. 09 May 2021.

Vancouver:

Wu S. Finding Tree t-spanners on Interval, Permutation and Trapezoid Graphs. [Internet] [Thesis]. NSYSU; 2002. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0826102-160304.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wu S. Finding Tree t-spanners on Interval, Permutation and Trapezoid Graphs. [Thesis]. NSYSU; 2002. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0826102-160304

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

22. Chen, Ming-You. Efficient Algorithms for Computing Shortest Path on Directed and Undirected Double-Loop Networks.

Degree: Master, Computer Science and Engineering, 2003, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825103-160926

► In this thesis, we present two e cent algorithms to compute shortest path between pair of vertices in directed and undirected double-loop networks. The algorithm…
(more)

Subjects/Keywords: Routing Algorithm; Shortest Path; Double Loop Networks

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Chen, M. (2003). Efficient Algorithms for Computing Shortest Path on Directed and Undirected Double-Loop Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825103-160926

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Chen, Ming-You. “Efficient Algorithms for Computing Shortest Path on Directed and Undirected Double-Loop Networks.” 2003. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825103-160926.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chen, Ming-You. “Efficient Algorithms for Computing Shortest Path on Directed and Undirected Double-Loop Networks.” 2003. Web. 09 May 2021.

Vancouver:

Chen M. Efficient Algorithms for Computing Shortest Path on Directed and Undirected Double-Loop Networks. [Internet] [Thesis]. NSYSU; 2003. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825103-160926.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen M. Efficient Algorithms for Computing Shortest Path on Directed and Undirected Double-Loop Networks. [Thesis]. NSYSU; 2003. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825103-160926

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

23. Yen, Pei-lan. The Convexity Spectra and the Strong Convexity Spectra of Graphs.

Degree: Master, Applied Mathematics, 2005, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728105-104156

► Given a connected oriented graph D, we say that a subset S of V(D) is convex in D if, for every pair of vertices x,…
(more)

Subjects/Keywords: Convex set; convexity number; convexity spectrum; complete graph

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Yen, P. (2005). The Convexity Spectra and the Strong Convexity Spectra of Graphs. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728105-104156

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Yen, Pei-lan. “The Convexity Spectra and the Strong Convexity Spectra of Graphs.” 2005. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728105-104156.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yen, Pei-lan. “The Convexity Spectra and the Strong Convexity Spectra of Graphs.” 2005. Web. 09 May 2021.

Vancouver:

Yen P. The Convexity Spectra and the Strong Convexity Spectra of Graphs. [Internet] [Thesis]. NSYSU; 2005. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728105-104156.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yen P. The Convexity Spectra and the Strong Convexity Spectra of Graphs. [Thesis]. NSYSU; 2005. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0728105-104156

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

24. Chiang, Hsiao-wa. Distinguishing sets of the actions of S_5.

Degree: Master, Applied Mathematics, 2006, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0619106-170029

► Suppose Gamma is a group acting on a set X. An r-labeling phi: X to {1, 2, ..., r} of X is distinguishing (with respect…
(more)

Subjects/Keywords: group action; distinguishing number; distinguishing set

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Chiang, H. (2006). Distinguishing sets of the actions of S_5. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0619106-170029

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Chiang, Hsiao-wa. “Distinguishing sets of the actions of S_5.” 2006. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0619106-170029.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chiang, Hsiao-wa. “Distinguishing sets of the actions of S_5.” 2006. Web. 09 May 2021.

Vancouver:

Chiang H. Distinguishing sets of the actions of S_5. [Internet] [Thesis]. NSYSU; 2006. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0619106-170029.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chiang H. Distinguishing sets of the actions of S_5. [Thesis]. NSYSU; 2006. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0619106-170029

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

25. Chiang, Yu-Chin. The Graphs induced by the Noncommutativity of Groups.

Degree: Master, Applied Mathematics, 2007, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0320107-102752

We consider the graphs induced by the noncommutativity of groups and discuss some properties of the largest complete subgraphs of these graphs.
*Advisors/Committee Members: Xuding Zhu (chair), Tsai-Lien Wong (committee member), Li-Da Tong (chair).*

Subjects/Keywords: Noncommutativity; Complete subgraph

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Chiang, Y. (2007). The Graphs induced by the Noncommutativity of Groups. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0320107-102752

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Chiang, Yu-Chin. “The Graphs induced by the Noncommutativity of Groups.” 2007. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0320107-102752.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chiang, Yu-Chin. “The Graphs induced by the Noncommutativity of Groups.” 2007. Web. 09 May 2021.

Vancouver:

Chiang Y. The Graphs induced by the Noncommutativity of Groups. [Internet] [Thesis]. NSYSU; 2007. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0320107-102752.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chiang Y. The Graphs induced by the Noncommutativity of Groups. [Thesis]. NSYSU; 2007. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0320107-102752

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

26. Yang, Chung-ying. List circular coloring of even cycles.

Degree: Master, Applied Mathematics, 2004, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627104-190111

► Suppose G is a graph and p >= 2q are positive integers. A color-list is a mapping L: V – > P(0, 1,...,p-1) which assigns…
(more)

Subjects/Keywords: even cycle; circular coloring

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Yang, C. (2004). List circular coloring of even cycles. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627104-190111

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Yang, Chung-ying. “List circular coloring of even cycles.” 2004. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627104-190111.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yang, Chung-ying. “List circular coloring of even cycles.” 2004. Web. 09 May 2021.

Vancouver:

Yang C. List circular coloring of even cycles. [Internet] [Thesis]. NSYSU; 2004. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627104-190111.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yang C. List circular coloring of even cycles. [Thesis]. NSYSU; 2004. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627104-190111

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

27. Tsai, Chia-Fang. Jordan Isomorphisms and Jordan Derivations of Prime Rings with characteristic 2.

Degree: Master, Applied Mathematics, 2004, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0624104-213250

► In this thesis, we describe the Jordan isomorphisms and Jordan derivations on prime rings of characteristic 2. We prove that every Jordan isomorphism of M_{n}(F),n…
(more)

Subjects/Keywords: characteristic 2; Jordan Isomorphism; Jordan Derivation; Prime Ring

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Tsai, C. (2004). Jordan Isomorphisms and Jordan Derivations of Prime Rings with characteristic 2. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0624104-213250

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Tsai, Chia-Fang. “Jordan Isomorphisms and Jordan Derivations of Prime Rings with characteristic 2.” 2004. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0624104-213250.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tsai, Chia-Fang. “Jordan Isomorphisms and Jordan Derivations of Prime Rings with characteristic 2.” 2004. Web. 09 May 2021.

Vancouver:

Tsai C. Jordan Isomorphisms and Jordan Derivations of Prime Rings with characteristic 2. [Internet] [Thesis]. NSYSU; 2004. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0624104-213250.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tsai C. Jordan Isomorphisms and Jordan Derivations of Prime Rings with characteristic 2. [Thesis]. NSYSU; 2004. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0624104-213250

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

28. Liao, Shih-kai. Chip Firing and Fractional Chromatic Number of the Kneser Graph.

Degree: Master, Applied Mathematics, 2004, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629104-161112

► In this thesis we focus on the investigation of the relation between the the chip-firing and fractional coloring. Since chi_{f}(G)=inf {n/k : G is homomorphic…
(more)

Subjects/Keywords: fractional chromatic number; chip firing

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Liao, S. (2004). Chip Firing and Fractional Chromatic Number of the Kneser Graph. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629104-161112

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Liao, Shih-kai. “Chip Firing and Fractional Chromatic Number of the Kneser Graph.” 2004. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629104-161112.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liao, Shih-kai. “Chip Firing and Fractional Chromatic Number of the Kneser Graph.” 2004. Web. 09 May 2021.

Vancouver:

Liao S. Chip Firing and Fractional Chromatic Number of the Kneser Graph. [Internet] [Thesis]. NSYSU; 2004. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629104-161112.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liao S. Chip Firing and Fractional Chromatic Number of the Kneser Graph. [Thesis]. NSYSU; 2004. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629104-161112

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

29. Yang, Chao-Chi. Perfectness of the complements of circular complete graph.

Degree: Master, Applied Mathematics, 2005, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618105-000001

► For p>=2qï¼let Kp/q be the graph with vertices 0ï¼1ï¼2ï¼â¦ï¼p-1 in which i~j if q<=|i-j|<=p-q. The circular chromatic number Xc(G) of a graph G is the…
(more)

Subjects/Keywords: perfect

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Yang, C. (2005). Perfectness of the complements of circular complete graph. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618105-000001

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Yang, Chao-Chi. “Perfectness of the complements of circular complete graph.” 2005. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618105-000001.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yang, Chao-Chi. “Perfectness of the complements of circular complete graph.” 2005. Web. 09 May 2021.

Vancouver:

Yang C. Perfectness of the complements of circular complete graph. [Internet] [Thesis]. NSYSU; 2005. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618105-000001.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yang C. Perfectness of the complements of circular complete graph. [Thesis]. NSYSU; 2005. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618105-000001

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

30. Chen, Li-Fang. Jordan isomorphisms of triangular matrix algebras with characteristic 2.

Degree: Master, Applied Mathematics, 2004, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629104-030359

► Every Jordan isomorphism of triangular nÃn matrices over F with characteristic 2 is either a isomorphism or a antiisomorphism while n is 2. But it…
(more)

Subjects/Keywords: Jordan isomorphism; triangular matrix

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Chen, L. (2004). Jordan isomorphisms of triangular matrix algebras with characteristic 2. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629104-030359

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Chen, Li-Fang. “Jordan isomorphisms of triangular matrix algebras with characteristic 2.” 2004. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629104-030359.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chen, Li-Fang. “Jordan isomorphisms of triangular matrix algebras with characteristic 2.” 2004. Web. 09 May 2021.

Vancouver:

Chen L. Jordan isomorphisms of triangular matrix algebras with characteristic 2. [Internet] [Thesis]. NSYSU; 2004. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629104-030359.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen L. Jordan isomorphisms of triangular matrix algebras with characteristic 2. [Thesis]. NSYSU; 2004. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0629104-030359

Not specified: Masters Thesis or Doctoral Dissertation