Undirected random d-regular graphsR. CasteloA. Roverato
Sampling (d + 1)-colorings of d-regular graphs Let G be a graph of maximum degree ∆ and k be an integer. The recoloring framework consists in finding step-by-step transformations between two proper c... N Bousquet∗,G Perarnau† 被引量: 0发表: 0年 Spreads in Strongly Regular ...
Colorings of the d -regular infinite treeGRAPHSThe existence of small d-regular graphs of a prescribed girth g is equivalent to the existence of certain codes in the d-regular infinite tree. We show that in the tree "perfect" codes exist, but those are usually not "graphic". We also ...
Distance-Regular Graphs with c i = b d-i and Antipodal Double Covers[J]. Journal of Algebraic Combinatorics . 1998 (... Makoto,ArayaAkira,Hiraki - 《Journal of Algebraic Combinatorics》 被引量: 7发表: 1998年 Distance-Regular Graphs withci=bd-iand Antipodal Double Covers Makoto Araya,Akira...
Contribution Graphs for GitHub: Check your GitHub contributions using Home Screen Widgets App Store Screenshot 1 Screenshot 2 2024 swift ☆341 Fivey: iOS 14 widget to show FiveThirtyEight's 2020 election model results Screenshot 1 2020 swift macos widgetkit ☆18 Fruta: Create a shared ...
Strongly regular graphHyperbolic quadricTwisted Grassmann graphsGM switchingWe construct a new family of strongly regular graphs with the same parameters as the strongly regular graphs D 5 , 5 ( q ) . The construction can be seen as a variant of the construction of twisted Grassmann graphs by ...
The problem of enumerating spanning trees on graphs and lattices is considered. We obtain bounds on the number of spanning trees $N_{ST}$ and establish inequalities relating the numbers of spanning trees of different graphs or lattices. A general formulation is presented for the enumeration of sp...
Using PySimpleGUI's color themes, you can produce graphs that are a notch above default graphs that most people create in Matplotlib.Front-endsThe "GUI Gap" mentioned earlier can be easily solved using PySimpleGUI. You don't even need to have the source code to the program you wish to ...
Error-correcting pooling designs associated with some distance-regulargraphs Wang, Error-correcting pooling designs associated with some distance-regular graphs, Discrete Appl. Math. 157 (2009) 1581-1585... Y Bai,TayuanHuang,K Wang - 《Discrete Applied Mathematics》 被引量: 0发表: 2009年 群試設...
Help Om Nom determine in which ways he can cut off the first several beads from the found thread (at least one; probably, all) so that they form a regular pattern. When Om Nom cuts off the beads, he doesn't change their order. Input The first line contains two integers n, k (1...