Add to ORKGDegree sequences of some types of graphs will be studied and characterized in this paper
summary:Let $r\ge 3$, $n\ge r$ and $\pi =(d_1,d_2,\ldots ,d_n)$ be a non-increasing sequence of nonn...
In this paper we introduce a new concept called degree product graphs of and denoted by We apply...
There are typically several nonisomorphic graphs having a given degree sequence, and for any two deg...
Degree sequences of some types of graphs will be studied and characterized in this paper
Degree sequences of some types of graphs will be studied and characterized in this paper. Key words:...
For many types of graphs, criteria have been discovered that give necessary and sufficient condition...
AbstractWe call a simple graph highly irregular if each of its vertices is adjacent only to vertices...
This paper addresses the classical problem of characterizing degree sequences that can be realized b...
Thesis with publications.Submission note: A thesis submitted in total fulfilment of the requirements...
summary:We introduce a new concept namely the degree polynomial for the vertices of a simple graph. ...
AbstractIn this paper we give degree sequence conditions for the equality of edge-connectivity and m...
Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced sub...
The paper sets out to investigate the degree sequences d1≥d2≥...≥dn of random graphs of order n in w...
A k-monocore graph is a graph which has its minimum degree and degeneracy both equal to k. Integer s...
Abstract: This paper gives necessary and sufficient conditions for an integral sequence to be the si...
summary:Let $r\ge 3$, $n\ge r$ and $\pi =(d_1,d_2,\ldots ,d_n)$ be a non-increasing sequence of nonn...
In this paper we introduce a new concept called degree product graphs of and denoted by We apply...
There are typically several nonisomorphic graphs having a given degree sequence, and for any two deg...
Degree sequences of some types of graphs will be studied and characterized in this paper
Degree sequences of some types of graphs will be studied and characterized in this paper. Key words:...
For many types of graphs, criteria have been discovered that give necessary and sufficient condition...
AbstractWe call a simple graph highly irregular if each of its vertices is adjacent only to vertices...
This paper addresses the classical problem of characterizing degree sequences that can be realized b...
Thesis with publications.Submission note: A thesis submitted in total fulfilment of the requirements...
summary:We introduce a new concept namely the degree polynomial for the vertices of a simple graph. ...
AbstractIn this paper we give degree sequence conditions for the equality of edge-connectivity and m...
Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced sub...
The paper sets out to investigate the degree sequences d1≥d2≥...≥dn of random graphs of order n in w...
A k-monocore graph is a graph which has its minimum degree and degeneracy both equal to k. Integer s...
Abstract: This paper gives necessary and sufficient conditions for an integral sequence to be the si...
summary:Let $r\ge 3$, $n\ge r$ and $\pi =(d_1,d_2,\ldots ,d_n)$ be a non-increasing sequence of nonn...
In this paper we introduce a new concept called degree product graphs of and denoted by We apply...
There are typically several nonisomorphic graphs having a given degree sequence, and for any two deg...