Mazzuoccolo, On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings, J. Graph Theory 77 (2014) 144 - 157L. Esperet and G. Mazzuoccolo. On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings. J. Graph Theory, 77(2):144-...
Let G be an undirected graph without multiple edges and with a loop at every vertex—the set of edges of G corresponds to a reflexive and symmetric binary relation on its set of vertices. Then every edge-preserving map of the set of vertices of G to itself fixes an edge [{f(a), f...
Haemers c - 《Journal of Combinatorial Theory》 被引量: 85发表: 2009年 The least eigenvalue of unicyclic graphs with vertices and pendant vertices Let U ( n , k ) be the set of unicyclic graphs with n vertices and k pendant vertices. In this paper, we determine the unique graph with...
A set of vertices S resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is... J Cáceres,C Hernando,M Mora,... - 《Siam Journal on Discrete Mathematics》 被引量: 452发表: 2007年 ...
The complete graph, path and cycle of order n are denoted by Kn, Pn and Cn, respectively. For convenience, any tree of order n is denoted by Tn. Let G be a graph. Then V(G) (resp., E(G)) denotes the vertex (resp., edge) set of G. For an edge e∈E(G), G−e and ...
For a property π on graphs, the corresponding edge-contraction problem P EC( π) is defined as follows: Given a graph G, find a set of edges of minimum cardinality whose contraction results in a graph satisfying property π. In this paper we show that the edge-contraction problem P EC(...
Summary: For $k$-uniform hypergraphs $F$ and $H$ and an integer $r\\\ge 2$, let $c_{r,F}(H)$ denote the number of $r$-colorings of the set of hyperedges o... H Lefmann,Y Person,M Schacht - 《J Comb》 被引量: 34发表: 2010年 Monochromatic Hamiltonian t-tight Berge-cycl...
Y Sun - 《Discussiones Mathematicae Graph Theory》 被引量: 5发表: 2016年 The Restricted Edge-Connectivity of Strong Product Graphs The restricted edge-connectivity of a connected graph G, denoted by λ′ (G) , if it exists, is the minimum cardinality of a set of edges whose deletion m.....
C Delorme - 《Journal of Graph Theory》 被引量: 27发表: 1980年 On bandwidth and edgesum for the composition of two graphs The composition of two graphs G and H , written G [ H ], is the graph with vertex set V ( G ) 脳 V ( H ) and with ( u 1 , v 1 ) adjacent to (...
During the transform process, data in the prediction set are predicted by data in the update set; the prediction errors are then stored for encoding. In order to reduce the energy of the prediction residue, we propose to use optimized sampling on graphs to select the update set. Experiments ...