Results 51 to 60 of about 408 (81)

Heavy Subgraphs, Stability and Hamiltonicity

Discussiones Mathematicae Graph Theory, 2017
Let G be a graph. Adopting the terminology of Broersma et al. and Čada, respectively, we say that G is 2-heavy if every induced claw (K1,3) of G contains two end-vertices each one has degree at least |V (G)|/2; and G is o-heavy if every induced claw of G
Li Binlong, Ning Bo
doaj   +1 more source

Variantes del problema del cartero mixto que se pueden resolver usando programación lineal

Revista de Matemática: Teoría y Aplicaciones, 2012
Dada una gráfica mixta y conexa con costos en sus aristas y arcos, el problema del cartero mixto consiste en encontrar un circuito cerrado de la gráfica mixta que recorra sus aristas y arcos a costo mínimo. Se sabe que este problema es NP-duro.
Francisco Javier Zaragoza Martínez, Rafael López Bracho   +1 more
doaj   +1 more source

Pancyclic Cayley Graphs [PDF]

, 2012
2010 Mathematics Subject Classification: Primary 05C25. Secondary 20K01, 05C45.Let Cay(G;S) denote the Cayley graph on a finite group G with connection set S. We extend two results about the existence of cycles in Cay(G;S) from cyclic groups to arbitrary
Parmenter, M. M.
core  

Eulerian $k$-dominating reconfiguration graphs [PDF]

Discrete Mathematics & Theoretical Computer Science
For a graph $G$, the vertices of the $k$-dominating graph, denoted $\mathcal{D}_k(G)$, correspond to the dominating sets of $G$ with cardinality at most $k$. Two vertices of $\mathcal{D}_k(G)$ are adjacent if and only if the corresponding dominating sets
M. E. Messinger, A. Porter
doaj   +1 more source

ALTERNATING AND SYMMETRIC GROUPS WITH EULERIAN GENERATING GRAPH

Forum of Mathematics, Sigma, 2017
Given a finite group $G$ , the generating graph $\unicode[STIX]{x1D6E4}(G)$
ANDREA LUCCHINI, CLAUDE MARION
doaj   +1 more source

Hamilton cycles in almost distance-hereditary graphs [PDF]

, 2013
Let $G$ be a graph on $n\geq 3$ vertices. A graph $G$ is almost distance-hereditary if each connected induced subgraph $H$ of $G$ has the property $d_{H}(x,y)\leq d_{G}(x,y)+1$ for any pair of vertices $x,y\in V(H)$.
Chen, Bing, Ning, Bo
core  

Cycle Partitions in Dense Regular Digraphs and Oriented Graphs

Forum of Mathematics, Sigma
A conjecture of Jackson from 1981 states that every d-regular oriented graph on n vertices with $n\leq 4d+1$ is Hamiltonian. We prove this conjecture for sufficiently large n.
Allan Lo, Viresh Patel, Mehmet Akif Yıldız   +2 more
doaj   +1 more source

Rainbow Hamilton cycles in random regular graphs

, 2005
A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n tends ...
Janson, Svante, Wormald, Nicholas
core   +2 more sources

Eulerian character degree graphs of solvable groups

AKCE International Journal of Graphs and Combinatorics
Let G be a finite group, let Irr(G) be the set of all complex irreducible characters of G and let cd(G) be the set of all degrees of characters in [Formula: see text] Let [Formula: see text] be the set of all primes that divide some degrees in [Formula ...
G. Sivanesan, C. Selvaraj, T. Tamizh Chelvam   +2 more
doaj   +1 more source

Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem. [PDF]

J Math Biol, 2018
Prohaska SJ, Berkemer SJ, Gärtner F, Gatter T, Retzlaff N, Students of the Graphs and Biological Networks Lab 2017, Höner Zu Siederdissen C, Stadler PF.   +7 more
europepmc   +1 more source