Profile minimization on products of graphs

檔案

日期

2006-05-01

類型

期刊名稱

DISCRETE MATHEMATICS

卷期與頁次

第 306 卷第 8-9 期,頁 792–800

ISSN

0012-365X

語言

英文

摘要

The profile minimization problem arose from the study of sparse matrix technique. In terms of graphs, the problem is to determine the profile of a graph G which is defined as P(G) = min(f) Sigma(v is an element of V(G)) max(x is an element of N[v]) (f(v) - f(x)), where f runs over all bijections from V (G) to [1, 2,..., vertical bar V(G)vertical bar] and N[v] = [v] boolean OR [x is an element of V(G) : xv is an element of E(G)]. The main result of this paper is to determine the profiles of K-m x K-n, K-s,K-t x K-n and P-m x K-n. (c) 2006 Elsevier B.V. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Tsao, Y., & Chang, G. (2006). Profile minimization on products of graphs. DISCRETE MATHEMATICS, 306(8-9), 792–800. https://doi.org/10.1016/j.disc.2006.01.015

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/12343