Some Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs
Authors
Abstract:
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
similar resources
some properties of fuzzy hilbert spaces and norm of operators
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
15 صفحه اولdetermination of some physical and mechanical properties red bean
چکیده: در این تحقیق، برخی خواص فیزیکی و مکانیکی لوبیا قرمز به-صورت تابعی از محتوی رطوبت بررسی شد. نتایج نشان داد که رطوبت بر خواص فیزیکی لوبیا قرمز شامل طول، عرض، ضخامت، قطر متوسط هندسی، قطر متوسط حسابی، سطح تصویر شده، حجم، چگالی توده، تخلخل، وزن هزار دانه و زاویه ی استقرار استاتیکی در سطح احتمال 1 درصد اثر معنی داری دارد. به طوری که با افزایش رطوبت از 54/7 به 12 درصد بر پایه خشک طول، عرض، ضخام...
15 صفحه اولCertain t-partite graphs
By making use of the generalized concept of orthogonality in Latin squares, certain t-partite graphs have been constructed and a suggestion for a net work system has been made.
full textIntegral complete r-partite graphs
A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper, we give a useful sufficient and necessary condition for complete r-partite graphs to be integral, from which we can construct infinite many new classes of such integral graphs. It is proved that the problem of finding such integral graphs is equivalent to the problem of solving some Diophantin...
full textThe Saturation Function of Complete Partite Graphs
A graph G is called F -saturated if it is F -free but the addition of any missing edge to G creates a copy of F . Let the saturation function sat(n, F ) be the minimum number of edges that an F -saturated graph on n vertices can have. We determine this function asymptotically for every fixed complete partite graph F as n tends to infinity and give some structural information about almost extrem...
full textSpanners of Complete k -Partite Geometric Graphs
We address the following problem: Given a complete k-partite geometric graph K whose vertex set is a set of n points in R, compute a spanner of K that has a “small” stretch factor and “few” edges. We present two algorithms for this problem. The first algorithm computes a (5 + )-spanner of K with O(n) edges in O(n log n) time. The second algorithm computes a (3 + )-spanner of K with O(n log n) e...
full textMy Resources
Journal title
volume 13 issue None
pages 131- 138
publication date 2018-05
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023