Add to ORKGAbstract. An S-graph is a graph G which is isomorphic to the complement of.2G Here, we present three infinite families of S-graphs. 1
En este artículo definimos dos familias de grafos llamadas C- grafos y -grafos y se prueba que los -...
AbstractWe discuss some properties of yet another class of graphs whose smallest member is the Peter...
We give a general construction leading to different non-isomorphic families of connected q-regular s...
A special type of family graphs (F-graphs, for brevity) are introduced. These are cactus-type graphs...
AbstractIn this paper we consider S-prime graphs, that is the graphs that cannot be represented as n...
A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not v...
A family of infinite cubic graphs Ys, s = 2, 3, 4, 5, is constructed. The vertices of Ys are lattice...
AbstractThe graph consisting of s paths joining two vertices is called s-bridge graph. In this paper...
In this paper some new methods of constructing infinite families of cospeetral graphs are presented....
This chapter describes distances between isomorphism classes or distances between graphs. An isomorp...
AbstractWe show that there are graphs G and H which satisfy: (I) for every integer n, H contains n d...
We discuss some concepts concerning graphs (mainly concepts of symmetrical extensions of graphs by g...
AbstractA graph is called a generalized S-graph if for every vertex v of G there exists exactly one ...
Two graphs G and H are Turker equivalent if they have the same set of Turker angles. In this paper s...
Abstract. Two general methods of constructing an infinite sequence (G = GI, G,,......) of graceful g...
En este artículo definimos dos familias de grafos llamadas C- grafos y -grafos y se prueba que los -...
AbstractWe discuss some properties of yet another class of graphs whose smallest member is the Peter...
We give a general construction leading to different non-isomorphic families of connected q-regular s...
A special type of family graphs (F-graphs, for brevity) are introduced. These are cactus-type graphs...
AbstractIn this paper we consider S-prime graphs, that is the graphs that cannot be represented as n...
A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not v...
A family of infinite cubic graphs Ys, s = 2, 3, 4, 5, is constructed. The vertices of Ys are lattice...
AbstractThe graph consisting of s paths joining two vertices is called s-bridge graph. In this paper...
In this paper some new methods of constructing infinite families of cospeetral graphs are presented....
This chapter describes distances between isomorphism classes or distances between graphs. An isomorp...
AbstractWe show that there are graphs G and H which satisfy: (I) for every integer n, H contains n d...
We discuss some concepts concerning graphs (mainly concepts of symmetrical extensions of graphs by g...
AbstractA graph is called a generalized S-graph if for every vertex v of G there exists exactly one ...
Two graphs G and H are Turker equivalent if they have the same set of Turker angles. In this paper s...
Abstract. Two general methods of constructing an infinite sequence (G = GI, G,,......) of graceful g...
En este artículo definimos dos familias de grafos llamadas C- grafos y -grafos y se prueba que los -...
AbstractWe discuss some properties of yet another class of graphs whose smallest member is the Peter...
We give a general construction leading to different non-isomorphic families of connected q-regular s...