Zobrazeno 1 - 10
of 12
pro vyhledávání: '"H. B. WALIKAR"'
Publikováno v:
Journal of the Serbian Chemical Society, Vol 65, Iss 11, Pp 799-801 (2000)
If G is a molecular graph with n vertices and if l1, l2, ..., ln are its eigenvalues, then the energy of G is equal to E(G) = |l1| + |l2|+ ... + |ln|. If E(G) > 2n 2, then G is said to be hyperenergetic. We show that no Hückel graph (= the graph rep
Externí odkaz:
https://doaj.org/article/2b14fd0b87494ec9bf674852341b9596
Autor:
H. B. Walikar, Narayan Swamy
Publikováno v:
International Journal of Mathematics Trends and Technology. 7:50-53
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b31a18ea2a00982105d242640d75660
https://doi.org/10.14445/22315373/ijmtt-v7p507
https://doi.org/10.14445/22315373/ijmtt-v7p507
Publikováno v:
International Journal of Computer Applications. 58:6-9
The most important criterion for achieving the maximum performance in wirless sensor and ad-hoc networks is to clustering the nodes. Many clustering schemes have been proposed for different ad-hoc networks. In sensor networks the energy stored in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1d99c021496684d977822ff728bd9be
https://doi.org/10.5120/9396-3345
https://doi.org/10.5120/9396-3345
Autor:
H. B. Walikar, Shreedevi V. Shindhe
Publikováno v:
International Journal of Computer Applications. 49:43-47
Every graph has one or more diametral paths. A diametral path of a graph is a shortest path whose length is equal to the diameter of the graph. Let be a diametral vertex. There may be one or more diametral paths originating from . We want to find all
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::930518faa667ab816c88ac28265fb922
https://doi.org/10.5120/7715-1174
https://doi.org/10.5120/7715-1174
Publikováno v:
Acta Mathematica Sinica, English Series. 27:2343-2350
The center of a graph is the set of vertices with minimum eccentricity. Graphs in which all vertices are central are called self-centered graphs. In this paper almost self-centered (ASC) graphs are introduced as the graphs with exactly two non-centra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c15fee26984a80de2991d59552f92653
https://doi.org/10.1007/s10114-011-9628-3
https://doi.org/10.1007/s10114-011-9628-3
Publikováno v:
Aequationes mathematicae. 82:201-211
The graph resulting from contracting edge e is denoted as G/e and the graph resulting from deleting edge e is denoted as G − e. An edge e is diameter-essential if diam(G/e) < diam(G), diameter-increasing if diam(G − e) < diam(G), and diameter-vit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80908750acd146ad9fa4ca154e601c57
https://doi.org/10.1007/s00010-011-0087-9
https://doi.org/10.1007/s00010-011-0087-9
Publikováno v:
Designs, Codes and Cryptography. 57:91-105
A (v, β o , μ)-design over regular graph G = (V, E) of degree d is an ordered pair D = (V, B), where |V| = v and B is the set of maximum independent sets of G called blocks such that if i, j ? V, i ? j and if i and j are not adjacent in G then ther
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0fb9871e22cc9e74b1aa5222d6032018
https://doi.org/10.1007/s10623-009-9351-6
https://doi.org/10.1007/s10623-009-9351-6
Publikováno v:
International Journal of Computer Applications. 58:41-43
The purpose of this paper is to design an algorithm for star partitions of the graph. We shall now bring out a useful connection between the domination number of a graph and what we shall choose to call the ‘star partition number’ of the graph wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd2f341547df46d32f0540ae3a1c98e5
https://doi.org/10.5120/9250-3416
https://doi.org/10.5120/9250-3416
Publikováno v:
Taiwanese J. Math. 18, no. 2 (2014), 463-471
The center $C(G)$ and the periphery $P(G)$ of a connected graph $G$ consist of the vertices of minimum and maximum eccentricity, respectively. Almost-peripheral (AP) graphs are introduced as graphs $G$ with $|P(G)| = |V(G)| - 1$ (and $|C(G)| = 1$). A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1277fba66a3131268ade301ff8b78c6
https://doi.org/10.11650/tjm.18.2014.3267
https://doi.org/10.11650/tjm.18.2014.3267
Publikováno v:
Electronic Notes in Discrete Mathematics. 15:103
This paper enumerates Distance Degree Regular (DDR) graphs of diameter three with given regularity. Enumerating DDR graphs of diameter three for arbitrary regularity seems difficult. However, the existence of such a graph is assured.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3e3e2bd3cf40836bb8380c6ee85a8c6
https://doi.org/10.1016/s1571-0653(04)00545-1
https://doi.org/10.1016/s1571-0653(04)00545-1