找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(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ù)制鏈接]
查看: 41084|回復(fù): 45
樓主
發(fā)表于 2025-3-21 18:43:52 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱Exercises in Graph Theory
編輯O. Melnikov,V. Sarvanov,I. Zverovich
視頻videohttp://file.papertrans.cn/319/318517/318517.mp4
叢書(shū)名稱Texts in the Mathematical Sciences
圖書(shū)封面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

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




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




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




書(shū)目名稱Exercises in Graph Theory網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Exercises in Graph Theory被引頻次




書(shū)目名稱Exercises in Graph Theory被引頻次學(xué)科排名




書(shū)目名稱Exercises in Graph Theory年度引用




書(shū)目名稱Exercises in Graph Theory年度引用學(xué)科排名




書(shū)目名稱Exercises in Graph Theory讀者反饋




書(shū)目名稱Exercises in Graph Theory讀者反饋學(xué)科排名




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒(méi)有投票權(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) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-13 18:00
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
时尚| 红安县| 维西| 鄱阳县| 峨眉山市| 色达县| 和平区| 海伦市| 广丰县| 南澳县| 宝兴县| 大关县| 东源县| 惠水县| 崇左市| 遂宁市| 资阳市| 通河县| 托克逊县| 永寿县| 红安县| 石狮市| 抚顺市| 东城区| 富宁县| 平度市| 岫岩| 博白县| 怀远县| 宜宾市| 晋中市| 济源市| 旬阳县| 嘉善县| 荥经县| 大英县| 彭山县| 当雄县| 融水| 奈曼旗| 长葛市|