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

Muhammad JAVAID

Makale detayları

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

Yazarlar:

Muhammad JAVAID

Yayıncı:

TUBITAK

Dergi:

Turkish Journal of Mathematics 2017 Vol.41 Issue 6, pp.1433-1445

Belge Tipi:

Makale

Yayın Tarihi:

11/2017

Belge Dili:

Türkçe

Document ID (Org No.):

2000745965

Sıklık:

İki Aylık

eISSN:

1303-6149

pISSN:

1300-0098

Özet:

 

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.

Makale detayları

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

Yazarlar: Muhammad JAVAID

Yayıncı: TUBITAK

Dergi: Turkish Journal of Mathematics 2017 Vol.41 Issue 6, pp.1433-1445

Belge Tipi: Makale

Yayın Tarihi: 11/2017

Belge Dili: Türkçe

Document ID (Org No.): 2000745965

Sıklık: İki Aylık

eISSN: 1303-6149

pISSN: 1300-0098

Sayı

Yazarlar:

Muhammad JAVAID

Yayıncı:

TUBITAK

Dergi:

Turkish Journal of Mathematics 2017 Vol.41 Issue 6, pp.1433-1445

Belge Tipi:

Makale

Yayın Tarihi:

11/2017

Belge Dili:

Türkçe

Document ID (Org No.):

2000745965

Sıklık:

İki Aylık

eISSN:

1303-6149

pISSN:

1300-0098