Search engine for discovering works of Art, research articles, and books related to Art and Culture
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...
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 ...
New structure of algebras using permutations in symmetric groups
New structure of algebras using permutations in symmetric groups
The permutation BG-algebras were first introduced as a novel kind of algebra. In this work, their basic qualities were investigated to better understand how they relate to one anot...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
Finite edge-transitive Cayley graphs and rotary Cayley maps
Finite edge-transitive Cayley graphs and rotary Cayley maps
This paper aims to develop a theory for studying Cayley graphs, especially for those with a high degree of symmetry. The theory consists of analysing several types of basic Cayley ...
The Brood Hen of Faction: Mrs. Macaulay and Radical Politics, 1765-1775
The Brood Hen of Faction: Mrs. Macaulay and Radical Politics, 1765-1775
The middle years of the eighteenth century in England were on the whole a period when few women made any impact on the public scene. Writing gradually became a respectable way for ...