Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
نویسندگان
چکیده
منابع مشابه
Characterization of the Minimizing Graph of the Connected Graphs Whose Complements Are Bicyclic
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. Let Gc 1,n and Gc 2,n be the classes of the connected graphs of order n whose complements are bicyclic with exactly two and t...
متن کاملThe least eigenvalue of graphs whose complements are unicyclic
A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order n and size m in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size n 2 ). In this paper we discuss the ...
متن کاملCritical graphs with connected complements
We show that given any vertex x of a k-colour-critical graph G with a connected complement, the graph G − x can be (k − 1)-coloured so that every colour class contains at least 2 vertices. This extends the well-known theorem of Gallai, that a k-colour-critical graph with a connected complement has at least 2k − 1 vertices. Our proof does not use matching theory. It is considerably shorter, conc...
متن کاملSome Families of Graphs whose Domination Polynomials are Unimodal
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.
متن کاملconnected graphs cospectral with a friendship graph
let $n$ be any positive integer, the friendship graph $f_n$ consists of $n$ edge-disjoint triangles that all of them meeting in one vertex. a graph $g$ is called cospectral with a graph $h$ if their adjacency matrices have the same eigenvalues. recently in href{http://arxiv.org/pdf/1310.6529v1.pdf}{http://arxiv.org/pdf/1310.6529v1.pdf} it is proved that if $g$ is any graph cospectral with $f_n$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF MATHEMATICS
سال: 2017
ISSN: 1300-0098,1303-6149
DOI: 10.3906/mat-1608-6