Topological Hoarded Graphs

dc.contributor.author	POLAT, Kadirhan
dc.date.accessioned	2024-04-05T08:01:02Z
dc.date.available	2024-04-05T08:01:02Z
dc.date.issued	2023
dc.identifier.issn	2147-3129
dc.identifier.uri	http://dspace.beu.edu.tr:8080/xmlui/handle/123456789/14779
dc.description.abstract	In this paper, we first introduced the steps that need to be taken to get the set-family that goes with a hoarded graph, as well as an example of how these steps could be used. Then, we explained what a topological hoarded graph is and showed when a set-family induced by a topological hoarded graph is a topology on a set. We also presented some useful facts about topological hoarded graphs.	tr_TR
dc.language.iso	English	tr_TR
dc.publisher	Bitlis Eren Üniversitesi	tr_TR
dc.rights	info:eu-repo/semantics/openAccess	tr_TR
dc.subject	Hoarded graph.	tr_TR
dc.subject	Topological hoarded graph,	tr_TR
dc.subject	Topology.	tr_TR
dc.title	Topological Hoarded Graphs	tr_TR
dc.type	Article	tr_TR
dc.identifier.issue	1	tr_TR
dc.relation.journal	Bitlis Eren Üniversitesi Fen Bilimleri Dergisi	tr_TR
dc.identifier.volume	12	tr_TR