On the Complexity of Molecular Graphs, pp. 187-201 - MATCH
Recommend Documents
For details on the theory of graph energy see the reviews [7,8,10], the book [17], ... Based on this observation, the concept of almostâequienergetic graphs was ...
of vertices closer to the vertex y than vertex x. Recently Vukicevic and Zerovnik put forward a class of modified Wiener indices â the -variable Wiener indices, ...
The nullity of a graph is the multiplicity of the eigenvalues zero in its spectrum. In ..... be the graph obtained by deleting x, y from G, where G11,G12,...,G1t are ...
[email protected], sabeena [email protected]. bDepartment of ..... [15] H. S. Ramane, H. B. Walikar, Construction of equienergetic graphs, MATCH. Commun.
Jan 28, 2015 - This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any ...
The first capacity-achieving sequences of ensembles of low-density parity-check (LDPC) codes for the binary erasure channel (BEC) were found by Luby et al.
used in the comparative study of the structure-motor octane number modeling. ... methyl groups, the number of amino groups) and the Balaban index [11].
May 2, 2016 - arXiv:1605.00532v1 [cs.DS] 2 May 2016 ... on graphs with bounded degree and reload costs adhering to the triangle inequality,. MinCCA on ...
Abstract. Disk intersection (respectively, touching) graphs are the in- tersection graphs of closed disks in the plane whose interiors may (re- spectively, may not) ...
May 2, 2016 - 5 Department of Industrial Engineering, BoËgaziçi University, Istanbul, Turkey. Abstract. ..... 1 , which will be the root of H. Note that the graph ...... transformed in time O(n3) to a nice tree-cut decomposition of G without increa
We conclude that infinite games on finite graphs play an important role in the ..... cation of reactive systems, examples of games which can be specified in this ...
A graph is cubical if it is a subgraph of a hypercube; the dimension of the smallest such .... Proof We reduce EXACT COVER (Garey and Johnson, 1979) to.
The concept of geometricâarithmetic indices (GA) was introduced in the .... It can be easily seen that arithmetic mean is attained when p = 1, and geometric.
et al. gave a lower bound for the energy E(G) of graph G. In MATCH Commun. Math. Comput. ... 2]), while [x] denotes integer part of a real number x. Moreover ...
Email: [email protected]. 2Department of Mathematics, Karnatak University,. Dharwad â 580003, India. Email: [email protected]. (Received October ...
In this paper we solve the problem of constructing a pair of equienergetic graphs ..... [14] E. Sampathkumar, H. B. Walikar, On the splitting graph of a graph, ...
e-mail: [email protected]. 3Faculty of Science, University of Kragujevac, 34000 Kragujevac, Serbia e-mail: [email protected]. (Received May 27, 2016).
MATCH. Communications in Mathematical and in Computer Chemistry ..... [26] G. Indulal, A. Vijayakumar, On a pair of equienergetic graphs, MATCH Com- mun.
The eigenvalue of a graph G is the eigenvalue of its adjacency matrix. ..... [6] R. A. Horn, C. R. Johnson, Topics in Matrix Analysis, Cambridge Univ. Press,.
Jan 25, 2013 - Both of the classes of caterpillars and proper interval graphs consist of very .... For a point p, let N[p] denote the set of intervals containing the ..... for each p = 0, 0.5, 1, 1.5, 2, 2.5,...,P − 0.5,P. We note that for each integ
Nov 16, 2007 - when molecular graphs are rigid may be significantly easier than the .... We say that a 2-thin cover X of a graph G = (V,E) is independent if.
matian and Pony Express [10]; together they produced over a thousand of ..... about carcinogenic and stable benzenoids, (available from the author on request).
MATCH. Communications in Mathematical and in Computer Chemistry .... [6] H. S. Ramane, H. B. Walikar, Construction of equienergetic graphs, MATCH Com-.
On the Complexity of Molecular Graphs, pp. 187-201 - MATCH
where (L)is the submatrix of L derived by deleting row i and column j. The value of ... like mathematica or maple could be used for computing efficiently t(G). 2.3.
