Related papers: Independence and Matching Numbers of Unicyclic Gra…
In this work we obtain basis for the null space of unicyclic graphs. We extend the null decomposition of trees from [11] for unicyclic graphs. As an application, we obtain closed formulas for the independence and matching numbers of…
In this paper we introduce the nullity of signed graphs, and give some results on the nullity of signed graphs with pendant trees. We characterize the unicyclic signed graphs of order n with nullity n-2; n-3; n-4; n-5 respectively.
The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…
A set S is independent in a graph G if no two vertices from S are adjacent. By core(G) we mean the intersection of all maximum independent sets. The independence number alpha(G) is the cardinality of a maximum independent set, while mu(G)…
For a directed acyclic graph, there are two known criteria to decide whether any specific conditional independence statement is implied for all distributions factorized according to the given graph. Both criteria are based on special types…
Let $G$ be a graph of order $n$ and let $k\in\{1,\ldots,n-1\}$. The $k$-token graph $F_k(G)$ of $G$, is the graph whose vertices are the $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their symmetric difference…
Let $T$ be a tree, we show that the null space of the adjacency matrix of $T$ has relevant information about the structure of $T$. We introduce the Null Decomposition of trees, and use it in order to get formulas for independence number and…
Consider a graph on the non-singular matrices over a finite field, in which two distinct non-singular matrices are joined by an edge whenever their sum is singular. We prove an upper bound for the independence number of this graph. As a…
An independent set in a graph is a set of pairwise non-adjacent vertices. The independence number $\alpha{(G)}$ is the size of a maximum independent set in the graph $G$. The independence polynomial of a graph is the generating function for…
The goal of this paper is to obtain quantitative results on the number and on the size of maximal independent sets and maximal matchings in several block-stable graph classes that satisfy a proper sub-criticality condition. In particular we…
We consider a family of distance graphs in $\mathbb{R}^n$ and find its independent numbers in some cases. Define graph $J_{\pm}(n,k,t)$ in the following way: the vertex set consists of all vectors from $\{-1,0,1\}^n$ with $k$ nonzero…
In this paper, we prove that for every connected graph G, there exists a split graph H with the same independence number and the same order. Then we propose a first algorithm for finding this graph, given the degree sequence of the input…
In this work we study the null space of bipartite graphs without cycles of length multiple of $4$, and its relation to structural properties. We decompose them into two subgraphs: $C_N(G)$ and $C_S(G)$. $C_N(G)$ has perfect matching and its…
We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…
We study the inertia of distance matrices of weighted graphs. Our novel congruence-based proof of the inertia of weighted trees extends to a proof for the inertia of weighted unicyclic graphs whose cycle is a triangle. Partial results are…
The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…
An independent set in a graph is a set of pairwise non-adjacent vertices. Let $\alpha(G)$ denote the cardinality of a maximum independent set in the graph $G = (V, E)$. Gutman and Harary defined the independence polynomial of $G$ \[ I(G;x)…
Motivated by the question of which structural properties of a graph can be recovered from the chromatic symmetric function (CSF), we study the CSF of connected unicyclic graphs. While it is known that there can be non-isomorphic unicyclic…
The independence equivalence class of a graph $G$ is the set of graphs that have the same independence polynomial as $G$. A graph whose independence equivalence class contains only itself, up to isomorphism, is independence unique. Beaton,…
The combinatorial properties of double vertex graphs has been widely studied since the 90's. However only very few results are know about the independence number of such graphs. In this paper we obtain the independence numbers of the double…