ON THE MINIMAL PATH COVER SETS OF UNION OF CERTAIN GRAPHS

Khashyarmanesh Kazem; Nasernejad Mehrdad

首页> 外文期刊>Quaestiones mathematicae >ON THE MINIMAL PATH COVER SETS OF UNION OF CERTAIN GRAPHS

【24h】

ON THE MINIMAL PATH COVER SETS OF UNION OF CERTAIN GRAPHS

机译：关于某些图形的最小路径覆盖套

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

In this paper, we study minimal path cover sets of union of certain graphs. As consequences, we study max-path ideals with certain heights.

机译：在本文中，我们研究了某些图表的最小路径覆盖套。作为后果，我们研究了具有一定高度的最大路径理想。

著录项

来源
《Quaestiones mathematicae》 |2020年第7期|881-901|共21页
作者
Khashyarmanesh Kazem; Nasernejad Mehrdad;
展开▼
作者单位

Ferdowsi Univ Mashhad Dept Pure Math POB 1159-91775 Mashhad Razavi Khorasan Iran;

Ferdowsi Univ Mashhad Dept Pure Math POB 1159-91775 Mashhad Razavi Khorasan Iran;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
Trees; paths; cycles; associated primes;

机译：树木;路径;周期;相关的素数;

相似文献

外文文献
中文文献
专利

1. Orthogonal Double Covers of Complete Bipartite Graphsby A Special Class of Disjoint Union of Path andA Complete Bipartite Graph [J] . R. El-Shanawany, H. Shabana British Journal of Mathematics Computer Science . 2013,第3期

机译：一类特殊的不相交路径和一个完全二部图的完全二部图的正交双覆盖
2. Minimal path cover sets and monomial ideals [J] . Sharifan Leila, Nasernejad Mehrdad, Khashyarmanesh Kazem Journal of algebra and its applications . 2015,第2期

机译：最少的路径套和理想的理想选择
3. Computation of minimal rank and path cover number for certain graphs [J] . Barioli F, Fallat S, Hogben L Linear Algebra and its Applications . 2004,第0期

机译：某些图形的最小等级和路径覆盖数的计算
4. Strong shortest path union cover problem for product graphs [C] . Santiagu Theresal, Antony Xavier, Deepa Mathew International Conference on Advances in Applicable Mathematics . 2020

机译：最短的最短路径联盟涵盖产品图表的问题
5. Upper bound for minimal disjoint path/cycle coverings of n-vertex simple connected graphs. [D] . Weston, Christina. 2009

机译：n顶点简单连接图的最小不相交路径/循环覆盖率的上限。
6. Predicting Polyp Location on Optical Colonoscopy from CT Colonography by Minimal-energy Curve Modeling of the Colonoscope Path [O] . Jiamin Liu, Kevin W. Chang, Jianhua Yao, -1

机译：从CT结肠成像光学结肠镜息肉预测由定位结肠镜路径的最小能量曲线造型
7. Strong shortest path union cover for some networks and Sierpi'{n}ski graphs [O] . Theresal Santiagu, Xavier Antony, Mathew Deepa 2020

机译：对于某些网络和Sierpi '{n}滑雪图，最短的最短路径联盟覆盖
8. Sorting, Minimal Feedback Sets and Hamilton Paths in Tournaments [R] . Bar-Noy, A., Naor, J. 1988

机译：锦标赛中的排序，最小反馈集和汉密尔顿路径

ON THE MINIMAL PATH COVER SETS OF UNION OF CERTAIN GRAPHS

摘要

著录项

相似文献

相关主题

期刊订阅