Add to ORKGDegree sequences of some types of graphs will be studied and characterized in this paper. Key words: Graph, degree sequence, simple graph, 1−graph, digraph, graphic sequence, 1-graphic sequence, digraphic sequences, bigraphic sequences
We study conditions to approximate the degree sequence of a given graph by a regular one. We obtain ...
A nonincreasing sequence pi = (d1, d2,···,dn) of nonnegative integers is said to be graphic if it i...
The level set G(n,m) comprises all unlabelled simple graphs of order n and size m, and is partitione...
Degree sequences of some types of graphs will be studied and characterized in this paper
summary:We introduce a new concept namely the degree polynomial for the vertices of a simple graph. ...
This paper addresses the classical problem of characterizing degree sequences that can be realized b...
Abstract: This paper gives necessary and sufficient conditions for an integral sequence to be the si...
AbstractGiven a graph (digraph) G with edge (arc) set E(G) = {(u1}, υ1), (u2, υ2),⋯,(uq, υq, where q...
For many types of graphs, criteria have been discovered that give necessary and sufficient condition...
Thesis with publications.Submission note: A thesis submitted in total fulfilment of the requirements...
AbstractIn this paper we use the concept of integer-pair sequences, an invariant of graphs and digra...
Seven criteria for integer sequences being graphic are listed. Being graphic means that there is a s...
Seven criteria for integer sequences being graphic are listed. Being graphic means that there is a s...
AbstractWe call a simple graph highly irregular if each of its vertices is adjacent only to vertices...
This thesis focuses on the intersection of two classical and fundamental areas in graph theory: grap...
We study conditions to approximate the degree sequence of a given graph by a regular one. We obtain ...
A nonincreasing sequence pi = (d1, d2,···,dn) of nonnegative integers is said to be graphic if it i...
The level set G(n,m) comprises all unlabelled simple graphs of order n and size m, and is partitione...
Degree sequences of some types of graphs will be studied and characterized in this paper
summary:We introduce a new concept namely the degree polynomial for the vertices of a simple graph. ...
This paper addresses the classical problem of characterizing degree sequences that can be realized b...
Abstract: This paper gives necessary and sufficient conditions for an integral sequence to be the si...
AbstractGiven a graph (digraph) G with edge (arc) set E(G) = {(u1}, υ1), (u2, υ2),⋯,(uq, υq, where q...
For many types of graphs, criteria have been discovered that give necessary and sufficient condition...
Thesis with publications.Submission note: A thesis submitted in total fulfilment of the requirements...
AbstractIn this paper we use the concept of integer-pair sequences, an invariant of graphs and digra...
Seven criteria for integer sequences being graphic are listed. Being graphic means that there is a s...
Seven criteria for integer sequences being graphic are listed. Being graphic means that there is a s...
AbstractWe call a simple graph highly irregular if each of its vertices is adjacent only to vertices...
This thesis focuses on the intersection of two classical and fundamental areas in graph theory: grap...
We study conditions to approximate the degree sequence of a given graph by a regular one. We obtain ...
A nonincreasing sequence pi = (d1, d2,···,dn) of nonnegative integers is said to be graphic if it i...
The level set G(n,m) comprises all unlabelled simple graphs of order n and size m, and is partitione...