skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Decycling Numbers of Strong Product Graphs involving Paths, Circuits, Stars or Complete Graphs

Authors:
; ;
Publication Date:
Research Org.:
Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1169849
Report Number(s):
LLNL-JRNL-658728
DOE Contract Number:
DE-AC52-07NA27344
Resource Type:
Journal Article
Resource Relation:
Journal Name: International Journal of Applied Mathematics and Statistics, vol. 52, no. 8, October 6, 2014, pp. 83-90
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE

Citation Formats

Xie, J, Chen, X, and Lai, Y. Decycling Numbers of Strong Product Graphs involving Paths, Circuits, Stars or Complete Graphs. United States: N. p., 2014. Web.
Xie, J, Chen, X, & Lai, Y. Decycling Numbers of Strong Product Graphs involving Paths, Circuits, Stars or Complete Graphs. United States.
Xie, J, Chen, X, and Lai, Y. Tue . "Decycling Numbers of Strong Product Graphs involving Paths, Circuits, Stars or Complete Graphs". United States. doi:. https://www.osti.gov/servlets/purl/1169849.
@article{osti_1169849,
title = {Decycling Numbers of Strong Product Graphs involving Paths, Circuits, Stars or Complete Graphs},
author = {Xie, J and Chen, X and Lai, Y},
abstractNote = {},
doi = {},
journal = {International Journal of Applied Mathematics and Statistics, vol. 52, no. 8, October 6, 2014, pp. 83-90},
number = ,
volume = ,
place = {United States},
year = {Tue Aug 12 00:00:00 EDT 2014},
month = {Tue Aug 12 00:00:00 EDT 2014}
}
  • A new problem of Ramsey type is posed for complete distance graphs in R{sup n} with vertices in the Boolean cube. This problem is closely related to the classical Nelson-Erdos-Hadwiger problem on the chromatic number of a space. Several quite sharp estimates are obtained for certain numerical characteristics that appear in the framework of the problem. Bibliography: 15 titles.
  • We consider connected finite 4-valent graphs with the structure of opposite edges at each vertex (framed 4-graphs). For any of such graphs there exist Euler tours, in travelling along which at each vertex we turn from an edge to a nonopposite one (rotating circuits); and at the same time, it is not true that for any such graph there exists an Euler tour passing from an edge to the opposite one at each vertex (a Gauss circuit). The main result of the work is an explicit formula connecting the adjacency matrices of the Gauss circuit and an arbitrary Euler tour.more » This formula immediately gives us a criterion for the existence of a Gauss circuit on a given framed 4-graph. It turns out that the results are also valid for all symmetric matrices (not just for matrices realisable by a chord diagram). Bibliography: 24 titles.« less
  • It is established that there exist sequences of distance graphs G{sub n} subset of R{sup n}, with chromatic numbers which grow exponentially, but, at the same time, without cliques or cycles of a given size. Bibliography: 42 titles.
  • We investigate in detail some properties of distance graphs constructed on the integer lattice. Such graphs find wide applications in problems of combinatorial geometry, in particular, such graphs were employed to answer Borsuk's question in the negative and to obtain exponential estimates for the chromatic number of the space. This work is devoted to the study of the number of cliques and the chromatic number of such graphs under certain conditions. Constructions of sequences of distance graphs are given, in which the graphs have unit length edges and contain a large number of triangles that lie on a sphere of radius 1/√3more » (which is the minimum possible). At the same time, the chromatic numbers of the graphs depend exponentially on their dimension. The results of this work strengthen and generalize some of the results obtained in a series of papers devoted to related issues. Bibliography: 29 titles.« less
  • The charge-transfer (CT) complexes of hexamethyl(Dewar benzene) (HMDB) with electron acceptors, fumaronitrile, diethyl 1,2-dicyanofumarate, and 1,2,4,5-tetracyanobenzene, have been characterized and compared to similar complexes of hexamethylbenzene (HMB). Irradiation of HMDB CT bands in the 313-435-nm region under a variety of conditions leads to HMDB ..-->.. HMB isomerization. The quantum yield of rearrangement in a nonpolar solvent is low (e.g. 0.06), although the relative yield of adiabatic isomerization, monitored by emission for excited complexes of HMB, is high (0.72). Quantum efficiencies for isomerization of complexes in polar media generally exceed unity, consistent with a radical-ion chain mechanism for ring opening. Themore » quatum chain reaction depends on the polarity of the solvent, the reduction potential of the acceptor, the extent of conversion, and the wavelength of irradiation. The wavelength effect is associated with excitation to upper vibrational levels of a CT band with enchancement of ionic photodissociation. Comparison of the quantum yield results for excited CT complexes with the findings for rearrangement of HMDB via exciplexes reveals generally different patterns of reactivity.« less