國立虎尾科技大學 |

Zonality in Graphs.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Zonality in Graphs./
作者:	Bowling, Andrew.
面頁冊數:	1 online resource (87 pages)
附註:	Source: Dissertations Abstracts International, Volume: 84-11, Section: B.
Contained By:	Dissertations Abstracts International84-11B.
標題:	Mathematics. -
電子資源:	click for full text (PQDT)
ISBN:	9798379546151

Zonality in Graphs.
Bowling, Andrew.

Zonality in Graphs. - 1 online resource (87 pages)

Source: Dissertations Abstracts International, Volume: 84-11, Section: B.

Thesis (Ph.D.)--Western Michigan University, 2023.

Includes bibliographical references

Graph labeling and coloring are among the most popular areas of graph theory due to both the mathematical beauty of these subjects as well as their fascinating applications. While the topic of labeling vertices and edges of graphs has existed for over a century, it was not until 1966 when Alexander Rosa introduced a labeling, later called a graceful labeling, that brought the area of graph labeling to the forefront in graph theory. The subject of graph colorings, on the other hand, goes back to 1852 when the young British mathematician Francis Guthrie observed that the countries in a map of England could be colored with four colors so that every two adjacent countries are colored differently. This led to the Four Color Problem, which is the problem of determining whether the regions of every plane map can be colored with four or fewer colors in such a way that every two adjacent regions are colored differently. A computer aided solution for the Four Color Problem was announced in 1976 by Kenneth Appel and Wolfgang Haken, resulting in the famous Four Color Theorem. In 2014, the Australian physicist Cooroo Egan introduced a graph labeling referred to as a zonal labeling. A zonal labeling is a vertex labeling of a connected plane graph G with the two nonzero elements of the ring ℤ3 of integers modulo 3 such that the sum of the labels of the vertices on the boundary of every region of G is the zero element of ℤ3. A graph possessing a zonal labeling is a zonal graph. A related labeling, called an inner zonal labeling, is a labeling of the vertices of a plane graph G with the nonzero elements of ℤ3 such that the sum of the labels of the vertices on the boundary of every interior region of G is the zero element of ℤ3. A graph possessing an inner zonal labeling is an inner zonal graph. There is a close connection between the existence of zonal and inner zonal labelings of planar graphs and the Four Color Theorem. In this work, we study zonality and inner zonality for several well-known classes of graphs, determine which of these graphs are zonal or inner zonal, and present characterization results on the structures of zonal graphs. Furthermore, we investigate a relationship between zonal graphs and inner zonal graphs and establish a connection between inner zonal graphs and the Four Color Theorem.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798379546151Subjects--Topical Terms:

527692
Mathematics.
Subjects--Index Terms:

Cycle rankIndex Terms--Genre/Form:

554714
Electronic books.

Zonality in Graphs.
LDR:03643ntm a22003977 4500 001 1144639
005 20240611104326.5
006 m o d
007 cr mn ---uuuuu
008 250605s2023 xx obm 000 0 eng d
020 $a 9798379546151
035 $a (MiAaPQ)AAI30313228
035 $a AAI30313228
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Bowling, Andrew. $3 1469735
245 1 0 $a Zonality in Graphs.
264 0 $c 2023
300 $a 1 online resource (87 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 84-11, Section: B.
500 $a Advisor: Zhang, Ping.
502 $a Thesis (Ph.D.)--Western Michigan University, 2023.
504 $a Includes bibliographical references
520 $a Graph labeling and coloring are among the most popular areas of graph theory due to both the mathematical beauty of these subjects as well as their fascinating applications. While the topic of labeling vertices and edges of graphs has existed for over a century, it was not until 1966 when Alexander Rosa introduced a labeling, later called a graceful labeling, that brought the area of graph labeling to the forefront in graph theory. The subject of graph colorings, on the other hand, goes back to 1852 when the young British mathematician Francis Guthrie observed that the countries in a map of England could be colored with four colors so that every two adjacent countries are colored differently. This led to the Four Color Problem, which is the problem of determining whether the regions of every plane map can be colored with four or fewer colors in such a way that every two adjacent regions are colored differently. A computer aided solution for the Four Color Problem was announced in 1976 by Kenneth Appel and Wolfgang Haken, resulting in the famous Four Color Theorem. In 2014, the Australian physicist Cooroo Egan introduced a graph labeling referred to as a zonal labeling. A zonal labeling is a vertex labeling of a connected plane graph G with the two nonzero elements of the ring ℤ3 of integers modulo 3 such that the sum of the labels of the vertices on the boundary of every region of G is the zero element of ℤ3. A graph possessing a zonal labeling is a zonal graph. A related labeling, called an inner zonal labeling, is a labeling of the vertices of a plane graph G with the nonzero elements of ℤ3 such that the sum of the labels of the vertices on the boundary of every interior region of G is the zero element of ℤ3. A graph possessing an inner zonal labeling is an inner zonal graph. There is a close connection between the existence of zonal and inner zonal labelings of planar graphs and the Four Color Theorem. In this work, we study zonality and inner zonality for several well-known classes of graphs, determine which of these graphs are zonal or inner zonal, and present characterization results on the structures of zonal graphs. Furthermore, we investigate a relationship between zonal graphs and inner zonal graphs and establish a connection between inner zonal graphs and the Four Color Theorem.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Mathematics. $3 527692
650 4 $a Theoretical mathematics. $3 1180455
653 $a Cycle rank
653 $a Dutch windmill
653 $a Four color theorem
653 $a Graph theory
653 $a Labelings
653 $a Zonality
655 7 $a Electronic books. $2 local $3 554714
690 $a 0642
690 $a 0405
710 2 $a Western Michigan University. $b Mathematics. $3 1469736
710 2 $a ProQuest Information and Learning Co. $3 1178819
773 0 $t Dissertations Abstracts International $g 84-11B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30313228 $z click for full text (PQDT)