Results 61 to 70 of about 134 (110)

The 2-pebbling property of squares of paths and Graham’s conjecture

Open Mathematics, 2020
A pebbling move on a graph G consists of taking two pebbles off one vertex and placing one pebble on an adjacent vertex. The pebbling number of a connected graph G, denoted by f(G), is the least n such that any distribution of n pebbles on G allows one ...
Li Yueqing, Ye Yongsheng
doaj   +1 more source

Packing Coloring of Some Undirected and Oriented Coronae Graphs

Discussiones Mathematicae Graph Theory, 2017
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that its set of vertices V(G) can be partitioned into k disjoint subsets V1, . . . , Vk, in such a way that every two distinct vertices in Vi are at distance greater than i in
Laïche Daouya, Bouchemakh Isma, Sopena Éric   +2 more
doaj   +1 more source

Decomposition of Certain Complete Bipartite Graphs into Prisms

Discussiones Mathematicae Graph Theory, 2017
Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj   +1 more source

Some stable and closed-shell structures of anticancer drugs by graph theoretical parameters. [PDF]

Heliyon, 2023
Koam ANA, Ahmad A, Azeem M, Hakami KH, Elahi K.   +4 more
europepmc   +1 more source

Computational validations of the asymptotic matching conjectures

, 2005
We describe several computational validations of the asymptotic matching conjectures for r-regular bipartite graphs. These validations are based on algorithms for computation of d-dimensional monomerdimer entropies in statistical mechanics and asymptotic
S Friedland, E Krop, K Markström, P H Lundow   +3 more
core  

Cores, Joins and the Fano-Flow Conjectures

Discussiones Mathematicae Graph Theory, 2018
The Fan-Raspaud Conjecture states that every bridgeless cubic graph has three 1-factors with empty intersection. A weaker one than this conjecture is that every bridgeless cubic graph has two 1-factors and one join with empty intersection.
Jin Ligang, Steffen Eckhard, Mazzuoccolo Giuseppe   +2 more
doaj   +1 more source

Ryser's Theorem for symmetric \(\rho\)-latin squares

Let \(L\) be an \(n\times n\) array whose top left \(r\times r\) subarray is filled with \(k\) different symbols, each occurring at most once in each row and at most once in each column.
Hilton, A. J. W., Bahmanian, Amin
core   +1 more source

Core Index of Perfect Matching Polytope for a 2-Connected Cubic Graph

Discussiones Mathematicae Graph Theory, 2018
For a 2-connected cubic graph G, the perfect matching polytope P(G) of G contains a special point xc=(13,13,…,13)$x^c = \left( {{1 \over 3},{1 \over 3}, \ldots ,{1 \over 3}} \right)$ . The core index ϕ(P(G)) of the polytope P(G) is the minimum number of
Wang Xiumei, Lin Yixun
doaj   +1 more source

Connectivity Concepts in Intuitionistic Fuzzy Incidence Graphs with Application. [PDF]

Int J Appl Comput Math, 2022
Nazeer I, Rashid T.
europepmc   +1 more source

A note on the edge general position number of cactus graphs

Open Mathematics
For a given graph G, a subset S of E(G) is an edge general position set of G if no triple of S is contained in a common shortest path. The cardinality of a largest edge general position set of G is called the edge general position number of G, denoted by
Cao Yahan, Ji Shengjin
doaj   +1 more source