شماره ركورد كنفرانس :
3502
عنوان مقاله :
Study of Algebraic Properties of Pseudo-Complete Graphs
Author/Authors :
Masoome Seyyedi Amirkabir University of Technology, Tehran , F Rahmati Faculty of Mathematics and Computer Science - Amirkabir University of Technology, Tehran
كليدواژه :
height , Krull dimension , projective dimension , regularity , depth
عنوان كنفرانس :
چهل و پنجمين كنفرانس رياضي ايران
چكيده لاتين :
In this paper we introduce a class of graphs, named pseudo-complete graphs, which are not complete, but near to complete graphs obtained by gluing of two complete graphs over a complete graph. Then we study some combinatorial and algebraic properties of these graphs. We will provide explicit formula to compute some properties of these graphs such as height, Krull dimension, projective dimension, regularity, depth in terms of those of the original graphs.
