Javascript must be enabled to continue!
Cohen-Macaulay permutation graphs
View through CrossRef
In this article, we characterize Cohen-Macaulay permutation graphs. In particular, we show that a permutation graph is Cohen-Macaulay if and only if it is well-covered and there exists a unique way of partitioning its vertex set into $r$ disjoint maximal cliques, where $r$ is the cardinality of a maximal independent set of the graph. We also provide some sufficient conditions for a comparability graph to be a uniquely partially orderable (UPO) graph.
Det Kgl. Bibliotek/Royal Danish Library
Title: Cohen-Macaulay permutation graphs
Description:
In this article, we characterize Cohen-Macaulay permutation graphs.
In particular, we show that a permutation graph is Cohen-Macaulay if and only if it is well-covered and there exists a unique way of partitioning its vertex set into $r$ disjoint maximal cliques, where $r$ is the cardinality of a maximal independent set of the graph.
We also provide some sufficient conditions for a comparability graph to be a uniquely partially orderable (UPO) graph.
Related Results
A Novel Image Encryption Algorithm Based on Double Permutation and Random Diffusion
A Novel Image Encryption Algorithm Based on Double Permutation and Random Diffusion
Abstract
To improve the image transmission security, an image encryption algorithm based on double permutation with random diffusion is proposed in this paper. This algorit...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...
Rose Macaulay and Propaganda
Rose Macaulay and Propaganda
The novelist Rose Macaulay (1881–1958) had direct professional experience of Britain's secret propaganda operation during the First World War. She was among the first British novel...
On certain invariants of idealizations
On certain invariants of idealizations
Let (R, m) be a Noetherian local ring and M a finitely generated R-module. In this paper, we study some invariants of the idealization R ⋉ M of R and M such as the polynomial type ...
BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE
BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE
The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture has been verified for all graphs with at most 11 vertices. Further, the conjectu...
Profiling Generalized Anxiety Disorder on Social Networks: Content and Behavior Analysis
Profiling Generalized Anxiety Disorder on Social Networks: Content and Behavior Analysis
Background
Despite a dramatic increase in the number of people with generalized anxiety disorder (GAD), a substantial number still do not seek help from health ...
Profiling Generalized Anxiety Disorder on Social Networks: Content and Behavior Analysis (Preprint)
Profiling Generalized Anxiety Disorder on Social Networks: Content and Behavior Analysis (Preprint)
BACKGROUND
Despite a dramatic increase in the number of people with generalized anxiety disorder (GAD), a substantial number still do not seek help from hea...

