Add to ORKGTwo graphs G and H are Turker equivalent if they have the same set of Turker angles. In this paper some Turker equivalent family of graphs are obtained
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
In this paper we present a necessary and sufficient condition for Hamiltonian graphs and also twoalg...
Abstract. An S-graph is a graph G which is isomorphic to the complement of.2G Here, we present thre...
Two graphs G and H are Türker equivalent if they have the same set of Türker angles. In this paper...
Given a set S and an equivalence relation R on S, one can define an equivalence graph with vertex se...
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of t...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
Abstract. Several relations on graphs, including primitive equivalence, ex-plosion equivalence and s...
This paper introduces equal degree graphs of simple existed graphs. These graphs exhibited some prop...
AbstractTwo graphs G and H with order n are said to be matching-equivalent if and only if the number...
For a simple graph G, let P(G?) be the chromatic polynomial of G. Two graphs G and H are said to be ...
AbstractLet G be the set of finite graphs whose vertices belong to some fixed countable set, and let...
AbstractWe give the definition of complete classes of chromatically equivalent graphs and some resul...
Let G = (V,E) be a graph. A subset S of V is called an equivalence set if every component of the ind...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
In this paper we present a necessary and sufficient condition for Hamiltonian graphs and also twoalg...
Abstract. An S-graph is a graph G which is isomorphic to the complement of.2G Here, we present thre...
Two graphs G and H are Türker equivalent if they have the same set of Türker angles. In this paper...
Given a set S and an equivalence relation R on S, one can define an equivalence graph with vertex se...
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of t...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
Abstract. Several relations on graphs, including primitive equivalence, ex-plosion equivalence and s...
This paper introduces equal degree graphs of simple existed graphs. These graphs exhibited some prop...
AbstractTwo graphs G and H with order n are said to be matching-equivalent if and only if the number...
For a simple graph G, let P(G?) be the chromatic polynomial of G. Two graphs G and H are said to be ...
AbstractLet G be the set of finite graphs whose vertices belong to some fixed countable set, and let...
AbstractWe give the definition of complete classes of chromatically equivalent graphs and some resul...
Let G = (V,E) be a graph. A subset S of V is called an equivalence set if every component of the ind...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
In this paper we present a necessary and sufficient condition for Hamiltonian graphs and also twoalg...
Abstract. An S-graph is a graph G which is isomorphic to the complement of.2G Here, we present thre...