The determinant of an antiadjacency matrix of a directed cycle graph with chords

D. Diwyacitta, A. P. Putra, Kiki Ariyanti, Suarsih Utama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In graph theory, the robustness of a network measures its resilience (in terms of connectivity) to either removal of network nodes or edges. Using algebraic connectivity is one of the best way to measure the robustness of a network. The higher algebraic connectivity means more robust network. The goal of this work is to improve the robustness of an existing air transportation network. It can be accomplished by adding edges (routes) to the network. However, due to limited budget and aircraft, the routes to be added have to be chosen carefully. The best routes to be added are the routes that will yield the highest algebraic connectivity when they were added to the network. This problem of choosing the best routes to be added is called flight routes addition. In this paper, the flight routes addition is solved using Tabu Search method with the algebraic connectivity component to choose two new lines to strengthening the robustness of the flight routes. We only consider the robustness and do not.

Original languageEnglish
Title of host publicationInternational Symposium on Current Progress in Mathematics and Sciences 2016, ISCPMS 2016
Subtitle of host publicationProceedings of the 2nd International Symposium on Current Progress in Mathematics and Sciences 2016
EditorsKiki Ariyanti Sugeng, Djoko Triyono, Terry Mart
PublisherAmerican Institute of Physics Inc.
ISBN (Electronic)9780735415362
DOIs
Publication statusPublished - 10 Jul 2017
Event2nd International Symposium on Current Progress in Mathematics and Sciences 2016, ISCPMS 2016 - Depok, Jawa Barat, Indonesia
Duration: 1 Nov 20162 Nov 2016

Publication series

NameAIP Conference Proceedings
Volume1862
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

Conference2nd International Symposium on Current Progress in Mathematics and Sciences 2016, ISCPMS 2016
CountryIndonesia
CityDepok, Jawa Barat
Period1/11/162/11/16

Fingerprint Dive into the research topics of 'The determinant of an antiadjacency matrix of a directed cycle graph with chords'. Together they form a unique fingerprint.

  • Cite this

    Diwyacitta, D., Putra, A. P., Ariyanti, K., & Utama, S. (2017). The determinant of an antiadjacency matrix of a directed cycle graph with chords. In K. A. Sugeng, D. Triyono, & T. Mart (Eds.), International Symposium on Current Progress in Mathematics and Sciences 2016, ISCPMS 2016: Proceedings of the 2nd International Symposium on Current Progress in Mathematics and Sciences 2016 [030127] (AIP Conference Proceedings; Vol. 1862). American Institute of Physics Inc.. https://doi.org/10.1063/1.4991231