Shellable Cactus Graphs (original) (raw)
Related papers
Cactus Graphs and Graphs Complement Conjecture
arXiv: Combinatorics, 2018
In this paper we proof that any cactus graph satisfies graph complement conjecture by finding a orthogonal representation of its complement in mathbbR5\mathbb{R}^5mathbbR5.
On the index of cactuses with n vertices
Publications de l'Institut Mathematique, 2006
Among all connected cactuses with n vertices we find a unique graph whose largest eigenvalue (index, for short) is maximal.
Star Edge Coloring of Cactus Graphs
Iranian Journal of Science and Technology, Transactions A: Science
A star edge coloring of a graph G is a proper edge coloring of G such that no path or cycle of length four is bi-colored. The star chromatic index of G, denoted by χ ′ s (G), is the minimum k such that G admits a star edge coloring with k colors. Bezegová et al.
Randic index, radius, and diameter for cactus graphs
2021
We study the Randić index for cactus graphs. It is conjectured to be bounded below by radius (for other than an even path), and it is known to obey several bounds based on diameter. We study radius and diameter for cacti then verify the radius bound and strengthen two diameter bounds for cacti. Along the way, we produce several other bounds for the Randić index in terms of graph size, order, and valency for several special classes of graphs, including chemical nontrivial cacti and cacti with starlike BC-trees.
Edge Coloring of Cactus Graphs with Given Spectrums
International Academy Journal Web of Scholar
An edge-coloring of a graph G is a coloring of the graph edges with integers such that the colors of the edges incident to any vertex of G are distinct. For an edge coloring α and a vertex v the set of all the colors of the incident edges of v is called the spectrum of that vertex in α and is denoted by
Electronic Journal of Combinatorics, 2016
In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General bi-Cohen-Macaulay graphs are classified up to separation. The inseparable bi-Cohen-Macaulay graphs are determined. We establish a bijection between the set of all trees and the set of inseparable bi-Cohen-Macaulay graphs.
(2,1)-Total Labelling of Cactus Graphs
2010
Abstract. A (2,1)-total labelling of a graph is an assignment of integers to each vertex and edge such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent edges of G receive distinct integers, and (iii) a vertex and its incident edge receive integers that differ by at least 2. The span of a (2,1)-total labelling is the maximum difference between two labels. The minimum span of a (2,1)total labelling of G is called the (2,1)-total number and denoted by . = ( , ) G V E
Vertex Decomposability of Path Complexes and Stanley’s Conjectures
Advanced Topics of Topology [Working Title], 2022
Monomials are the link between commutative algebra and combinatorics. With a simplicial complex Δ, one can associate two square-free monomial ideals: the Stanley-Reisner ideal IΔ whose generators correspond to the non-face of Δ, or the facet ideal I(Δ) that is a generalization of edge ideals of graphs and whose generators correspond to the facets of Δ. The facet ideal of a simplicial complex was first introduced by Faridi in 2002. Let G be a simple graph. The edge ideal I(G) of a graph G was first considered by R. Villarreal in 1990. He studied algebraic properties of I(G) using a combinatorial language of G. In combinatorial commutative algebra, one can attach a monomial ideal to a combinatorial object. Then, algebraic properties of this ideal are studied using combinatorial properties of combinatorial object. One of interesting problems in combinatorial commutative algebra is the Stanley’s conjectures. The Stanley’s conjectures are studied by many researchers. Let R be a Nn-graded...
Algebraic and combinatorial aspects of sandpile monoids on directed graphs
2011
The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile group is part of a larger algebraic structure on the graph, known as its sandpile monoid. Most of the work on sandpiles so far has focused on the sandpile group rather than the sandpile monoid of a graph, and has also assumed the underlying graph to be undirected. A notable exception is the recent work of Babai and Toumpakari, which builds up the theory of sandpile monoids on directed graphs from scratch and provides many connections between the combinatorics of a graph and the algebraic aspects of its sandpile monoid.