通常,对于图G和图F,如果有V(F)⊆V(G),E(F)⊆E(G),且ψF是ψG在E(F)上的限制,那么我们就称图F是图G的一个子图(subgragh),图G包含(contains)图F,图F包含于(contained in)图G。图G的任意子图F都可以通过对G重复进行点删除和边删除来得到:首先删除G中不在F内的边,然后再删除G中不在F内的...
Extremal problems involving the enumeration of graph substructures have a long history in graph theory. For example, the number of independent sets in a d-regular graph on n vertices is at most (2d+1−1)n/2d by the Kahn–Zhao theorem [7], [13]. Relaxing the regularity constraint to ...
Journal of Graph Theory . 2001A. Yeo, One-diregular subgraphs in semicomplete ... B Society-Springer-Verlag,F Pfender 被引量: 0发表: 2017年 One-Diregular Subgraphs in Semicomplete Multipartite Digraphs A. Yeo, One-diregular subgraphs in semicomplete multipartite digraphs, J. Graph Theory 24...
A clique subgraph in graph theory refers to a subset of nodes of an undirected graph such that every two different nodes in the clique are connected (Seidman and Foster, 1978). SBLR puts symmetry constraint on the coefficient matrix in the logistic regression, because the adjacency matrices of...
A graph is well covered if every maximal independent set has the same cardinality. A vertex x , in a well-covered graph G , is called extendable if G - {x}... A Finbow,B Hartnell,RJ Nowakowski - 《Journal of Graph Theory》 被引量: 71发表: 2010年 Recognizing planar perfect graphs...
On the number of strictly balanced subgraphs of a random graph. In Graph theory (Lag´ow, 1981), volume 1018 of Lecture Notes in Math., pages 79-83. Springer, Berlin, 1983.M. Karoński, A. Ruciński, On the number of strictly balanced subgraphs of a random graph, in: M. Borowiec...
Upper bounds on the number of bicliques in bipartite graphs and general graphs are gi... E Prisner - 《Combinatorica》 被引量: 100发表: 2000年 Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matrices We prove that the edge set of an arbitrary simple graph G on n...
求翻译:put forward that making use of subgraphs decomposition of graph theory and loop searching technology to determine the weak line in grid an the line which contain most protection circuit是什么意思?待解决 悬赏分:1 - 离问题结束还有 put forward that making use of subgraphs decomposition of ...
J. Combin. Theory Ser. B 117 (2016) 1–21Contents lists available at ScienceDirectJournal of Combinatorial Theory, Series Bwww.elsevier.com/locate/jctbNon-separating subgraphs in highly connected graphsShinya Fujitaa,∗ , Ken-ichi Kawarabayashi baInternational College of Arts and Sciences, Yokoh...
src/graphtheoryproject README.md build.xml manifest.mf Repository files navigation README Subgraphs-of-Graph This is project to graphically display subgraphs of graph with the use of jar file GraphStreamAbout This is project to graphically display subgraphs of graph with the use of jar file...