Title : ( Minimal path cover sets and monomial ideals )
Authors: Leila Sharifan , Mehrdad Nasernejad , Kazem Khashyarmanesh ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
In this paper, we introduce the concepts of minimal path cover sets and the index of covering of a simple graph G, and study the basic properties of these notions. Corresponding to these combinatorial concepts, we define max-path ideal and path cover ideal attached to G and study its algebraic properties in the case that G is a tree. Especially, we characterize the trees in which the max-path ideals have height 1 or 2.
Keywords
Trees; paths; monomial ideals
@article{paperid:1046573,
author = {Leila Sharifan and Mehrdad Nasernejad and Khashyarmanesh, Kazem},
title = {Minimal path cover sets and monomial ideals},
journal = {Journal of Algebra and its Applications},
year = {2014},
volume = {14},
number = {2},
month = {July},
issn = {0219-4988},
pages = {1550014--155001414},
numpages = {153451400},
keywords = {Trees; paths; monomial ideals},
}
%0 Journal Article
%T Minimal path cover sets and monomial ideals
%A Leila Sharifan
%A Mehrdad Nasernejad
%A Khashyarmanesh, Kazem
%J Journal of Algebra and its Applications
%@ 0219-4988
%D 2014
