Results 51 to 60 of about 81 (80)
Laplacian spectral radius and some Hamiltonian properties of graphs, manuscript
, 2014 . Using upper bounds for the spectral radius of graphs established by Cao, we in this note present sufficient conditions which are based on the spectral radius for some Hamiltonian properties of graphs. Keywords: Spectral radius, Hamiltonian property AMS
Rao Li
core
Direct Message Delivery Among Processors with Limited Capacity
, 2007 Processors with finite storage capacities send and receive messages among one another, with each message going directly from its sender to its recipient.
Devadatta M. Kulkarni +2 more
core
Hamiltonian properties of locally connnected graphs with bounded vertex degree
, 2009 We consider the existence of hamiltonian cycles for locally connected graphs with a bounded vertex degree. For a graph G, let ¢(G) and ±(G) denote the maximum and minimum vertex degrees, respectively.
Strusevich, Vitaly A. +3 more
core
Cycle Partitions in Dense Regular Digraphs and Oriented Graphs
Forum of Mathematics, SigmaA 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 +2 more
doaj +1 more source
Dominating Sets Whose Closed Stars Form Spanning Trees
, 1995 For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W .
Jerrold W. Grossman
core
A Note On k Best Solutions To The Chinese Postman Problem
, 1993 . The K-best problems on combinatorial optimization problems, in which K best solutions are considered instead of an optimal solution under the same conditions, have widely been studied. In this paper, we consider the K-best problem on the famous Chinese
Yasufumi Saruwatari, Tomomi Matsui
core
Eulerian character degree graphs of solvable groups
AKCE International Journal of Graphs and CombinatoricsLet 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 +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 +7 more
europepmc +1 more source
Addendum to “Ring elements as sums of units”
Open Mathematics, 2013 Lanski Charles, Maróti Attila
doaj +1 more source