Results 31 to 40 of about 91,886 (264)
Bounds for the pebbling number of product graphs [PDF]
Transactions on Combinatorics, 2022 Let $G$ be a connected graph. Given a configuration of a fixed number of pebbles on the vertex set of $G$, a pebbling move on $G$ is the process of removing two pebbles from a vertex and adding one pebble on an adjacent vertex. The pebbling number of $G$,
Nopparat Pleanmani +2 more
doaj +1 more source
Decomposition of planar graphs with forbidden configurations
Discrete Applied Mathematics, 2023 A $(d,h)$-decomposition of a graph $G$ is an ordered pair $(D, H)$ such that $H$ is a subgraph of $G$ of maximum degree at most $h$ and $D$ is an acyclic orientation of $G-E(H)$ with maximum out-degree at most $d$. In this paper, we prove that for $l \in \{5, 6, 7, 8, 9\}$, every planar graph without $4$- and $l$-cycles is $(2,1)$-decomposable.
Lingxi Li +3 more
openaire +2 more sources
Discrete Mathematics, 1993 The author gives a short survey on some relations between graphs and configurations. In particular, the analogy between configurations and regular bipartite graphs and certain graph-theoretic problems related to configurations are discussed.
openaire +2 more sources
On the Levi graph of point-line configurations [PDF]
Involve, a Journal of Mathematics, 2015 We prove that the well-covered dimension of the Levi graph of a point-line configuration (v_r, b_k) is equal to 0, whenever r > 2.
Hauschild, Jessica +2 more
openaire +3 more sources
On conditional configuration graphs with random distribution of vertex degrees
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2016 We consider a configuration graph with N vertices. The degrees of the vertices are drawn independently from a discrete power-law distribution with positive parameter τ . They are equal to the number of each vertex’s numbered semiedges.
Yury Pavlov
doaj +1 more source
Discrete Mathematics, 1997 The aim of this paper is to give a second survey on relations between graphs and configurations in the sense of the author's first part [Discrete Math. 111, 269-276 (1993; Zbl 0786.05088)]. It contains some further relations as well as additional remarks to topics which were mentioned in the first survey.
openaire +1 more source
Counting r-graphs without forbidden configurations
Journal of Combinatorial Theory, Series B, 2022 One of the major problems in combinatorics is to determine the number of $r$-uniform hypergraphs ($r$-graphs) on $n$ vertices which are free of certain forbidden structures. This problem dates back to the work of Erdős, Kleitman and Rothschild, who showed that the number of $K_r$-free graphs on $n$ vertices is $2^{\text{ex}(n,K_r)+o(n^2)}$.
József Balogh +2 more
openaire +2 more sources
Configuration synthesis of electric-drive transmissions for tracked vehicles
Advances in Mechanical Engineering, 2018 This article focus on the configuration synthesis of electric-drive transmissions for tracked vehicles. First, a new graph theory model is proposed to represent the transmission mechanism, which makes the complex transmission system easier to understand.
Ming-Fei Gao, Ji-Bin Hu, Zeng-Xiong Peng
doaj +1 more source
Probabilistic regular graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph ...
Christophe Morvan, Nathalie Bertrand
doaj +1 more source
Summarizing graphs using the configuration model
CoRR, 2020 Given a large graph, how can we summarize it with fewer nodes and edges while maintaining its key properties, such as spectral property? Although graphs play more and more important roles in many real-world applications, the growth of their size presents great challenges to graph analysis.
Houquan Zhou 0002 +5 more
openaire +2 more sources