We show that a simple graph U is edge-transitive if and only if it has the property that for any subgraphs G and H of U, there is a subgraph G 1 of G, isomorphic to a subgraph of H, with |E(G 1)| E(G)|·|E(H)| |
The analysis was carried out with a new method based on the combined use of a 3 Way Decisions model and graph theory. Specifically, the data about infected people in the Italian regions is assessed by means of an evaluation function which allows the tri-partitioning of Italy and the ...
当当网图书频道在线销售正版《A First Course in Graph Theory (图论基础教程)》,作者:徐俊明,出版社:科学出版社。最新《A First Course in Graph Theory (图论基础教程)》简介、书评、试读、价格、图片等相关信息,尽在DangDang.com,网购《A First Course in Graph Th
《图论及其算法》由苗连英、王萃琦主编,共分九章,主要内容包括图的基本概念、树、图的连通性、Euler环游和Hamilton回路、图的匹配、图的独立集和团、图的染色、平面图、网络流等。每章自成体系,不仅包含相关基础理论,还介绍了一些最新研究成果。另外,每章都穿插介绍了与章节内容紧密相关的若干算法等一些扩展阅读。本...
1.1 Graph and Graphical Representation Let V be a non-empty set. An ordered pair (x, y) or an unorder pair xy is often used to denote a binary relation between two elements in V , where (x, y) denotes a unilateral relation from x to y and xy denotes a bilateral relation between ...
百度试题 结果1 题目图论〔Graph Theory〕是数学的一个分支。它以图为研究对象。主要应用在计算机学科方法论的三个过程中的()。 A.抽象 B.理论 C.实验和论证 D.自动化设计及实现 相关知识点: 试题来源: 解析 A 反馈 收藏
A-First-Course-in-Graph-Theory组合网络理论-26 当当自营 商品详情 开本:16开 纸张: 包装:平装 是否套装:否 国际标准书号ISBN:9787030438638 丛书名:运筹与管理科学丛书24 所属分类:图书>自然科学>数学>代数 数论 组合理论 按需印刷说明 1.本产品为按需印刷(POD)图书,实行先付款,后印刷的流程。按需印刷商品,...
The primary aim of this book is to present a coherent introduction to graph theory, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and ...
(2012). A Method of Internet-Analysis by the Tools of Graph Theory. In: Advances in Intelligent Decision Technologies. SpringerVerlag Series: Smart Innovation, Systems and Technologies, 15(1): 35-44.Kavun, S. V., Mykhalchuk, I. V., Kalashnykova, N. I., Zyma, O. G. (2012). A ...
本篇论文主要解决最短路径问题中的一个变种,P2P问题,也就是point-2-point,单点到单点的最短路径问题。论文中允许对图做预处理,但是对于预处理得到的结果有限制,只允许存储空间是图的线性倍数,而且倍数因子不能太大。 最短路径问题被很多人研究过,有些是针对特定情况,例如平面图。有些利用了图以外的其他信息,...