Download
PDF 2.49 MB
master's thesis
116   91
Self-complementary Graphs
Svjetlana Prgomet (2017)
Josip Juraj Strossmayer University of Osijek
Department of Mathematics
Chair of Applied Mathematics
Computer Science Research Group
Cite this document

Prgomet, S. (2017). Samokomplementarni grafovi (Master's thesis). Retrieved from https://urn.nsk.hr/urn:nbn:hr:126:207102

Prgomet, Svjetlana. "Samokomplementarni grafovi." Master's thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2017. https://urn.nsk.hr/urn:nbn:hr:126:207102

Prgomet, Svjetlana. "Samokomplementarni grafovi." Master's thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2017. https://urn.nsk.hr/urn:nbn:hr:126:207102

Prgomet, S. (2017). 'Samokomplementarni grafovi', Master's thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, accessed 15 November 2019, https://urn.nsk.hr/urn:nbn:hr:126:207102

Prgomet S. Samokomplementarni grafovi [Master's thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics; 2017 [cited 2019 November 15] Available at: https://urn.nsk.hr/urn:nbn:hr:126:207102

S. Prgomet, "Samokomplementarni grafovi", Master's thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, Osijek, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:126:207102

Metadata
TitleSamokomplementarni grafovi
Title (english)Self-complementary Graphs
AuthorSvjetlana Prgomet
MentorSnježana Majstorović (mentor)
Committee memberKristian Sabo (predsjednik povjerenstva)
Committee memberSnježana Majstorović (član povjerenstva)
Committee memberDomagoj Ševerdija (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Department of Mathematics
(Chair of Applied Mathematics)
(Computer Science Research Group)
Osijek
Defense date and country2017-07-07, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Other Mathematical Disciplines
Abstract
Samokomplementarni grafovi su zanimljivi jer čine beskonačnu klasu grafova i imaju jaka strukturna svojstva. Na primjer, samokomplementaran graf mora imati točno \(\frac{n(n-1)}{4}\) bridova, radijus 2, dijametar 2 ili 3 i oni postoje za sve izvodive n. U radu su predstavljeni rezultati brojnih matematičara koji su proučavali samokomplementarne grafove u proteklih 50 godina. Vidjeli smo da su neki od njih korisniji pri dokazivanju da graf nije samokomplementaran. Zapravo, ne postoji jednostavan način kojim bismo dokazali da je neki graf samokomplementaran. Kod ovakvih grafova problem predstavalja ne samo njihovo prepoznavanje, nego općenito brojnost i međusobna izomorfnost.
Abstract (english)
Self-complementary graphs are interesting because they form an infnite class of graphs and have strong structural properties. For example, self-complementary graphs must have exactly \(\frac{n(n-1)}{4}\) edges, radius 2 and diameter 2 or 3 and they exist for every feasible value n. In this paper we present results discovered by the mathematicians who studied self-complementary graphs during the last 50 years. We have shown that some of them are more useful in proving that some graph is not self-complementary rather than it is self-complementary. In fact, there is no an easy way to prove that graph is self-complementary. The problem is not just in recognision of those graphs, but also in their number and mutual isomorphism.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:126:207102
Study programmeTitle: Mathematics and Computer Science
Study programme type: university
Study level: integrated undergraduate and graduate
Academic / professional title: magistar/magistra edukacije matematike i informatike (magistar/magistra edukacije matematike i informatike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of usehttp://rightsstatements.org/vocab/InC/1.0/
Created on2017-07-11 10:03:03