Muhammad JAVAID

8596

Minimizing graph of the connected graphs whose complements are bicyclic with two cycles

In a certain class of graphs, a graph is called minimizing if the least eigenvalueof its adjacency matrix attains the minimum. A connected graph containing two or three cycles is called a bicyclic graph if its number of edges is equal to its number of vertices plus one. In this paper, we characterize the minimizinggraph among all the connected graphs that belong to a class of graphs whose complements are bicyclic with two cycles.
Keywords:

Adjacency matrix, least eigenvalue bicyclic graphs,

PDF
Turkish Journal of Mathematics-Cover
  • ISSN: 1300-0098
  • Yayın Aralığı: 6
  • Yayıncı: TÜBİTAK
Arşiv
Sayıdaki Diğer Makaleler

Mahmood BIDKHAM, Sara AHAMADI

Mustafa Habil GÜRSOY, Hatice ASLAN, İlhan İÇEN

On the rate of Lp -convergence of Balakrishnan Rubin-type hypersingular integrals associated to the Gauss-Weierstrass semigroup

Melih ERYİGİT, Selim ÇOBANOĞLU

Suresh ELUMALAI, Toufik MANSOUR, Mohammad Ali ROSTAMI

Josip PECARIC, Mario KRNIC, Mirna RODIC

Başak AY SAYLAM

Meltem SERTBAŞ, Fatih YILMAZ

Zhinan XIA

Bankteshwar TIWARI, Ghanashyam Kr. PRAJAPATI

Mustafa DÜLDÜL, Bahar Uyar DÜLDÜL, Nuri KURUOĞLU, Ertuğrul ÖZDAMAR