Results 51 to 60 of about 1,099 (89)
The optimal pebbling of spindle graphs
Open Mathematics, 2019 Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The optimal pebbling number of G, denoted by πopt(G), is the smallest number
Gao Ze-Tu, Yin Jian-Hua
doaj +1 more source
Half domination arrangements in regular and semi-regular tessellation type graphs [PDF]
, 2012 We study the problem of half-domination sets of vertices in vertex transitive infinite graphs generated by regular or semi-regular tessellations of the plane.
Ionascu, Eugen J.
core
Rainbow Vertex-Connection and Forbidden Subgraphs
Discussiones Mathematicae Graph Theory, 2018 A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them ...
Li Wenjing, Li Xueliang, Zhang Jingshu
doaj +1 more source
An extremal problem on potentially $K_{m}-P_{k}$-graphic sequences
, 2005 A sequence $S$ is potentially $K_{m}-P_{k}$ graphical if it has a realization containing a $K_{m}-P_{k}$ as a subgraph. Let $\sigma(K_{m}-P_{k}, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with $\sigma(S)\geq \sigma(
Lai, Chunhui
core +1 more source
The Product Connectivity Banhatti Index of A Graph
Discussiones Mathematicae Graph Theory, 2019 Let G = (V, E) be a connected graph with vertex set V (G) and edge set E(G). The product connectivity Banhatti index of a graph G is defined as, PB(G)=∑ue1dG(u)dG(e)$PB(G) = \sum\nolimits_{ue} {{1 \over {\sqrt {{d_G}(u){d_G}(e)} }}}$ where ue means that ...
Kulli V.R. +2 more
doaj +1 more source
An extremal problem on potentially K p,1,1-graphic sequences
Discrete Mathematics & Theoretical Computer Science, 2005 A sequence S is potentially K p,1,1 graphical if it has a realization containing a K p,1,1 as a subgraph, where K p,1,1 is a complete 3-partite graph with partition sizes p,1,1.
Chunhui Lai
doaj
Discussiones Mathematicae Graph Theory, 2019 The Turán number of a graph H, denoted by ex(n, H), is the maximum number of edges in any graph on n vertices which does not contain H as a subgraph. Let Pk denote the path on k vertices and let mPk denote m disjoint copies of Pk.
Lan Yongxin, Qin Zhongmei, Shi Yongtang
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2018 A digraph is called irregular if its distinct vertices have distinct degree pairs. An irregular digraph is called minimal (maximal) if the removal of any arc (addition of any new arc) results in a non-irregular digraph. It is easily seen that the minimum
Górska Joanna +4 more
doaj +1 more source
Anti-Ramsey Number of Hanoi Graphs
Discussiones Mathematicae Graph Theory, 2019 Let ar(G,H) be the largest number of colors such that there exists an edge coloring of G with ar(G,H) colors such that each subgraph isomorphic to H has at least two edges in the same color. We call ar(G,H) the anti- Ramsey number for a pair of graphs (G,
Gorgol Izolda, Lechowska Anna
doaj +1 more source
On Nordhaus-Gaddum type relations of δ-complement graphs. [PDF]
Heliyon, 2023 Vichitkunakorn P +2 more
europepmc +1 more source