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

Muhammad Javaid | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Muhammad Javaid

Publication year - 2017

Publication title -

turkish journal of mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.454

H-Index - 27

eISSN - 1303-6149

pISSN - 1300-0098

DOI - 10.3906/mat-1608-6

Subject(s) - combinatorics , mathematics , adjacency matrix , pancyclic graph , discrete mathematics , graph , indifference graph , chordal graph , split graph , 1 planar graph

In a certain class of graphs, a graph is called minimizing if the least eigenvalue of 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 minimizing graph among all the connected graphs that belong to a class of graphs whose complements are bicyclic with two cycles.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research