On borderenergetic graphs
Чланак у часопису (Објављена верзија)
Метаподаци
Приказ свих података о документуАпстракт
A graph G of order n is said to be borderenergetic if its energy is equal
to 2n − 2 and if G̸∼
= Kn. The first such graphwas discovered in 2001, but their systematic
study started only in 2015. The main hitherto established results on borderenergetic graphs
are outlined, and a few new established. Borderenergetic graphs (of the same order) are
mutually equienergetic. The difference in their structure indicates which structural features
of a graph can vary, without affecting the value of its energy. In particular, it is shown that
this applies to the number of edges.
Кључне речи:
energy (of graph) / borderenergetic graph / hyperenergetic graph / equienergetic graphs / spectrum (of graph)Извор:
Bulletin T.CL de l’Académie serbe des sciences et des arts, 2017, 9-18Издавач:
- Beograd : Académie Serbe des sciences et des arts
Напомена:
- Bulletin t. 150 de l'Académie serbe des sciences et des arts. Classe des sciences mathématiques et naturelles. Sciences mathematiques no 42.
TY - JOUR AU - Gutman, Ivan PY - 2017 UR - https://dais.sanu.ac.rs/123456789/16440 AB - A graph G of order n is said to be borderenergetic if its energy is equal to 2n − 2 and if G̸∼ = Kn. The first such graphwas discovered in 2001, but their systematic study started only in 2015. The main hitherto established results on borderenergetic graphs are outlined, and a few new established. Borderenergetic graphs (of the same order) are mutually equienergetic. The difference in their structure indicates which structural features of a graph can vary, without affecting the value of its energy. In particular, it is shown that this applies to the number of edges. PB - Beograd : Académie Serbe des sciences et des arts T2 - Bulletin T.CL de l’Académie serbe des sciences et des arts T1 - On borderenergetic graphs SP - 9 EP - 18 UR - https://hdl.handle.net/21.15107/rcub_dais_16440 ER -
@article{ author = "Gutman, Ivan", year = "2017", abstract = "A graph G of order n is said to be borderenergetic if its energy is equal to 2n − 2 and if G̸∼ = Kn. The first such graphwas discovered in 2001, but their systematic study started only in 2015. The main hitherto established results on borderenergetic graphs are outlined, and a few new established. Borderenergetic graphs (of the same order) are mutually equienergetic. The difference in their structure indicates which structural features of a graph can vary, without affecting the value of its energy. In particular, it is shown that this applies to the number of edges.", publisher = "Beograd : Académie Serbe des sciences et des arts", journal = "Bulletin T.CL de l’Académie serbe des sciences et des arts", title = "On borderenergetic graphs", pages = "9-18", url = "https://hdl.handle.net/21.15107/rcub_dais_16440" }
Gutman, I.. (2017). On borderenergetic graphs. in Bulletin T.CL de l’Académie serbe des sciences et des arts Beograd : Académie Serbe des sciences et des arts., 9-18. https://hdl.handle.net/21.15107/rcub_dais_16440
Gutman I. On borderenergetic graphs. in Bulletin T.CL de l’Académie serbe des sciences et des arts. 2017;:9-18. https://hdl.handle.net/21.15107/rcub_dais_16440 .
Gutman, Ivan, "On borderenergetic graphs" in Bulletin T.CL de l’Académie serbe des sciences et des arts (2017):9-18, https://hdl.handle.net/21.15107/rcub_dais_16440 .
Related items
Showing items related by title, author, creator and subject.
-
Note on irregular graphs
Gutman, Ivan; Réti, Tamás (Beograd : Académie Serbe des sciences et des arts, 2018) -
Graph energies and their applications
Gutman, I.; Furtula, B. (Beograd : Académie Serbe des sciences et des arts, 2019) -
Some new models for multiprocessor interconnection networks
Cvetković, Dragoš; Davidović, Tatjana; Jovanović, Irena M. (Yugoslav Journal of Operations Research, 2016)