Add to ORKGA cactus is a connected graph whose all the blocks are isomorphic to cycle or complete graph on n vertices. We introduce symmetric regular cacti and a procedure for their construction. We discuss some characteristics of symmetric regular cacti. The number of symmetric regular cacti on given number of vertices are also enumerated. A possible application of present work to a real world problem for the committee formation is also suggested
Counting the number of maximal independent sets of graphs was started over $50$ years ago by Erd\H{o...
A graph $X$ is {\em symmetric} if its automorphism group acts transitively on the arcs of $X$, and {...
Phylogenetic networks are a generalization of evolutionary or phylogenetic trees that are commonly u...
A combinatorial bijection is given between pairs of permutations in S, the product of which is a giv...
Abstract. For a (molecular) graph, the first Zagreb indexM1 is equal to the sumof squares of its ver...
A combinatorial bijection is given between pairs of permutations in Sn the product of which is a giv...
AbstractThe purpose of this paper is to enumerate various classes of cyclically colored m-gonal plan...
A simple graph is reflexive if its second largest eigenvalue λ2 is less than or equal to 2. A graph ...
AbstractA connected graph G is a cactus if any two of its cycles have at most one common vertex. In ...
In this paper a new class of vertex decomposable graphs are determined. Moreover, all shellable and ...
In this paper a new class of vertex decomposable graphs are determined. Moreover, all shellable and ...
Abstract. A cactus graph is a connected graph in which every block is either an edge or a cycle. In ...
. A plane graph is called symmetric if it is invariant under the reflection across some straight lin...
AbstractIn this paper we consider three classes of chain hexagonal cacti and study their matching an...
A graph G is a difference graph iff there exists S ⊂ IN⁺ such that G is isomorphic to the graph DG(S...
Counting the number of maximal independent sets of graphs was started over $50$ years ago by Erd\H{o...
A graph $X$ is {\em symmetric} if its automorphism group acts transitively on the arcs of $X$, and {...
Phylogenetic networks are a generalization of evolutionary or phylogenetic trees that are commonly u...
A combinatorial bijection is given between pairs of permutations in S, the product of which is a giv...
Abstract. For a (molecular) graph, the first Zagreb indexM1 is equal to the sumof squares of its ver...
A combinatorial bijection is given between pairs of permutations in Sn the product of which is a giv...
AbstractThe purpose of this paper is to enumerate various classes of cyclically colored m-gonal plan...
A simple graph is reflexive if its second largest eigenvalue λ2 is less than or equal to 2. A graph ...
AbstractA connected graph G is a cactus if any two of its cycles have at most one common vertex. In ...
In this paper a new class of vertex decomposable graphs are determined. Moreover, all shellable and ...
In this paper a new class of vertex decomposable graphs are determined. Moreover, all shellable and ...
Abstract. A cactus graph is a connected graph in which every block is either an edge or a cycle. In ...
. A plane graph is called symmetric if it is invariant under the reflection across some straight lin...
AbstractIn this paper we consider three classes of chain hexagonal cacti and study their matching an...
A graph G is a difference graph iff there exists S ⊂ IN⁺ such that G is isomorphic to the graph DG(S...
Counting the number of maximal independent sets of graphs was started over $50$ years ago by Erd\H{o...
A graph $X$ is {\em symmetric} if its automorphism group acts transitively on the arcs of $X$, and {...
Phylogenetic networks are a generalization of evolutionary or phylogenetic trees that are commonly u...