AbstractIt is shown that, if m ≥ 3, there exists exactly one connected graph having m + 2 vertices and automorphism group Sm, the symmetric group of degree m. This theorem plays the central role in determining the least and greatest number of edges realizable by a connected graph having n vertices and automorphism group Sm
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
Our purpose is to introduce the concept of determining the smallest number of edges of a graph which...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
AbstractIt is shown that, if m ≥ 3, there exists exactly one connected graph having m + 2 vertices a...
AbstractThe least (and greatest) number of edges realizable by a graph having n vertices and automor...
AbstractA subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The e...
It is shown that there is only one automorphic graph with intersection array {12, 10, 5; 1, 1, 8}, a...
AbstractConsider a finite graph G(V,E). Let us associate to G a finite list P(G) of invariants. To a...
AbstractBy a graph we mean a finite undirected graph without loops and without multiple edges. The a...
It is shown that there are exactly 6 trivalent symmetric graphs of order at most 120 which are not b...
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
AbstractEntringer and Erdös introduced the concept of a unique subgraph of a given graph G and obtai...
summary:A digraph is a symmetric cycle if it is symmetric and its underlying graph is a cycle. It is...
AbstractThe concept of unique intersectability of a graph is introduced; this is related to the inte...
AbstractIn this note, it is shown that all graphs Fn,k for odd integer n ⩾ 5, and integer k ⩾ 1 are ...
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
Our purpose is to introduce the concept of determining the smallest number of edges of a graph which...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
AbstractIt is shown that, if m ≥ 3, there exists exactly one connected graph having m + 2 vertices a...
AbstractThe least (and greatest) number of edges realizable by a graph having n vertices and automor...
AbstractA subgraph H of a graph G is unique if H is not isomorphic to any other subgraph of G. The e...
It is shown that there is only one automorphic graph with intersection array {12, 10, 5; 1, 1, 8}, a...
AbstractConsider a finite graph G(V,E). Let us associate to G a finite list P(G) of invariants. To a...
AbstractBy a graph we mean a finite undirected graph without loops and without multiple edges. The a...
It is shown that there are exactly 6 trivalent symmetric graphs of order at most 120 which are not b...
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
AbstractEntringer and Erdös introduced the concept of a unique subgraph of a given graph G and obtai...
summary:A digraph is a symmetric cycle if it is symmetric and its underlying graph is a cycle. It is...
AbstractThe concept of unique intersectability of a graph is introduced; this is related to the inte...
AbstractIn this note, it is shown that all graphs Fn,k for odd integer n ⩾ 5, and integer k ⩾ 1 are ...
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
Our purpose is to introduce the concept of determining the smallest number of edges of a graph which...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
DOI
Add to ORKG