Results 11 to 20 of about 908,664 (294)
, 2016 We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers D. Our results rely on a classical bijection with mobiles (objects exhibiting a tree structure), combined with ...
Collet, Gwendal +2 more
openaire +3 more sources
The SLD vertex detector upgrade (VXD3) and a study of bbg events [PDF]
, 1998 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This thesis presents a variety of work concerning the design, construction and use of the SLD's vertex detector.
Dervan, Paul John
core +7 more sources
Vertex Graceful Labeling-Some Path Related Graphs [PDF]
, 2013 Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P. +2 more
core +1 more source
Vertex and edge covers with clustering properties: complexity and algorithms [PDF]
, 2009 We consider the concepts of a t-total vertex cover and a t-total edge cover (t≥1), which generalise the notions of a vertex cover and an edge cover, respectively.
Fernau, Henning +3 more
core +1 more source
Crown reductions for the Minimum Weighted Vertex Cover problem [PDF]
, 2004 The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International ...
Chlebikova, Janka +6 more
core +1 more source
Frugality Ratios and Improved Truthful Mechanisms for Vertex Cover [PDF]
, 2007 In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay as little as possible.
Elkind, Edith +2 more
core +2 more sources
On subgroups product graph of finite groups [PDF]
BIO Web of ConferencesThis paper explores Subgroup Product Graphs (SPG) in cyclic groups, presenting a Vertex Degrees Formula based on the prime factorization of a positive integer n.
Abd Shakir Jawad, Shelash Hayder B.
doaj +1 more source
Note on the Reformulated Zagreb Indices of Two Classes of Graphs
Journal of Chemistry, 2020 The reformulated Zagreb indices of a graph are obtained from the original Zagreb indices by replacing vertex degrees with edge degrees, where the degree of an edge is taken as the sum of degrees of its two end vertices minus 2.
Tongkun Qu +3 more
doaj +1 more source
, 2011 A graph that has a Smarandachely vertex-mean k-labeling is called Smarandachely k vertex-mean graph or Smarandachely k V -mean graph. Particularly, if k = 0, such a Smarandachely vertex-mean 0-labeling and Smarandachely 0 vertex-mean graph or ...
Lourdusamy, A., Seenivasan, M.
core +1 more source
Parameterized streaming : maximal matching and vertex cover [PDF]
, 2014 As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one.
Chitnis, Rajesh; id_orcid +11 more
core +1 more source