Formulas for counting connected spanning subgraphs with at most n+1 edges in Graphs Kn-e, Kn・e (コンピュテーション)

Formulas for counting connected spanning subgraphs with at most n+1 edges in Graphs Kn-e, Kn・e

(コンピュテーション)

Journal name: 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 108(89) 2008.6.16

This page shows libraries in Japan other than the National Diet Library that hold the material.

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

CiNii Research
Search Service
You can check the holdings of institutions and databases with which CiNii Research is linked at the site of CiNii Research.
Check the holdings of this book

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Material Type: 記事
Title: Formulas for counting connected spanning subgraphs with at most n+1 edges in Graphs Kn-e, Kn・e
Author/Editor: 程鵬
増山繁
Series Title: コンピュテーション
Author Heading: 程鵬
増山繁
Alternative Title: グラフKn-e、Kn・eにおいてn+1本以下の辺を持つ連結全域部分グラフの個数に関する計算式
Periodical title: 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報
No. or year of volume/issue: 108(89) 2008.6.16
Volume: 108
Issue: 89
Pages: 43～48
Publication date of volume/issue (W3CDTF): 2008-06-16
ISSN (Periodical Title): 0913-5685
ISSN-L (Periodical Title): 0913-5685
Publication (Periodical Title): 東京 : 電子情報通信学会
Place of Publication (Country Code): JP
Text Language Code: eng
Subject Heading: graph formula
connected spanning subgraph
log concave sequence
network reliability polynomial
NDLC: ZN33
Target Audience: 一般
Report No. (Article): COMP2008-21
Holding library: 国立国会図書館
Call No.: Z16-940
Data Provider (Database): 国立国会図書館 : 国立国会図書館雑誌記事索引
https://ndlsearch.ndl.go.jp
Bibliographic ID (NDL): 9572577
http://id.ndl.go.jp/bib/9572577
Bibliographic Record Category (NDL): 632