找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Exercises in Graph Theory; O. Melnikov,V. Sarvanov,I. Zverovich Textbook 1998 Springer Science+Business Media B.V., part of Springer Natur

[復(fù)制鏈接]
查看: 41081|回復(fù): 45
樓主
發(fā)表于 2025-3-21 18:43:52 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Exercises in Graph Theory
編輯O. Melnikov,V. Sarvanov,I. Zverovich
視頻videohttp://file.papertrans.cn/319/318517/318517.mp4
叢書名稱Texts in the Mathematical Sciences
圖書封面Titlebook: Exercises in Graph Theory;  O. Melnikov,V. Sarvanov,I. Zverovich Textbook 1998 Springer Science+Business Media B.V., part of Springer Natur
描述This book supplements the textbook of the authors" Lectures on Graph The- ory" [6] by more than thousand exercises of varying complexity. The books match each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs. The exercises are grouped into eleven chapters and numerous sections accord- ing to the topics of graph theory: paths, cycles, components, subgraphs, re- constructibility, operations on graphs, graphs and matrices, trees, independence, matchings, coverings, connectivity, matroids, planarity, Eulerian and Hamiltonian graphs, degree sequences, colorings, digraphs, hypergraphs. Each section starts with main definitions and brief theoretical discussions. They constitute a minimal background, just a reminder, for solving the exercises. the presented facts and a more extended exposition may be found in Proofs of the mentioned textbook of the authors, as well as in many other books in graph theory. Most exercises are supplied with answers and hints. In many cases complete solutions are given. At the end of the book you may find
出版日期Textbook 1998
關(guān)鍵詞Graph theory; Hypergraph; Matching; Matchings; Mathematica; VLSI; combinatorics; complexity; graphs; optimiza
版次1
doihttps://doi.org/10.1007/978-94-017-1514-0
isbn_softcover978-90-481-4979-7
isbn_ebook978-94-017-1514-0Series ISSN 0927-4529
issn_series 0927-4529
copyrightSpringer Science+Business Media B.V., part of Springer Nature 1998
The information of publication is updating

書目名稱Exercises in Graph Theory影響因子(影響力)




書目名稱Exercises in Graph Theory影響因子(影響力)學科排名




書目名稱Exercises in Graph Theory網(wǎng)絡(luò)公開度




書目名稱Exercises in Graph Theory網(wǎng)絡(luò)公開度學科排名




書目名稱Exercises in Graph Theory被引頻次




書目名稱Exercises in Graph Theory被引頻次學科排名




書目名稱Exercises in Graph Theory年度引用




書目名稱Exercises in Graph Theory年度引用學科排名




書目名稱Exercises in Graph Theory讀者反饋




書目名稱Exercises in Graph Theory讀者反饋學科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 20:57:10 | 只看該作者
Exercises in Graph Theory978-94-017-1514-0Series ISSN 0927-4529
板凳
發(fā)表于 2025-3-22 00:46:50 | 只看該作者
地板
發(fā)表于 2025-3-22 07:50:11 | 只看該作者
Being An Academic In A Time-Impoverished Ageh each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs.
5#
發(fā)表于 2025-3-22 10:05:49 | 只看該作者
,“BEFORE PHILOSOPHY”: ANCIENT MESOPOTAMIA,raph, and the elements of . are called its .. The sets of vertices and arcs of a digraph . are denoted by . and . respectively. The number |.| is called the . and is also denoted by |.|. If |.| = . and |.| = . then . is said to be an (.)-digraph.
6#
發(fā)表于 2025-3-22 16:02:32 | 只看該作者
7#
發(fā)表于 2025-3-22 19:33:20 | 只看該作者
8#
發(fā)表于 2025-3-22 21:26:05 | 只看該作者
Being An Academic In A Time-Impoverished Ageh each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs.
9#
發(fā)表于 2025-3-23 02:53:40 | 只看該作者
,“BEFORE PHILOSOPHY”: ANCIENT MESOPOTAMIA,raph, and the elements of . are called its .. The sets of vertices and arcs of a digraph . are denoted by . and . respectively. The number |.| is called the . and is also denoted by |.|. If |.| = . and |.| = . then . is said to be an (.)-digraph.
10#
發(fā)表于 2025-3-23 07:16:19 | 只看該作者
https://doi.org/10.1007/978-94-017-1514-0Graph theory; Hypergraph; Matching; Matchings; Mathematica; VLSI; combinatorics; complexity; graphs; optimiza
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-13 16:03
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
利津县| 正镶白旗| 达州市| 关岭| 汾阳市| 望奎县| 芦山县| 新竹市| 长武县| 上思县| 册亨县| 平原县| 南开区| 开阳县| 保靖县| 灵璧县| 宁蒗| 淮北市| 收藏| 恩平市| 丹东市| 钦州市| 武定县| 兰溪市| 柳江县| 高雄市| 邵武市| 留坝县| 永春县| 拜城县| 阿克陶县| 嵊州市| 盐城市| 海丰县| 鹤壁市| 涞水县| 长汀县| 保定市| 肇州县| 宁南县| 柘荣县|