Results 61 to 70 of about 1,416,244 (110)

Open Distance-Pattern Uniform Graphs [PDF]

, 2009
All graphs considered in this paper are finite, simple, undirected and connected. For graph theoretic terminology we refer to Harary [6].
Jose, Bibin K.
core   +1 more source

Smarandachely t-path step signed graphs [PDF]

, 2010
Characterizing signed graphs which are switching equivalent to their Smarandachely 3-path step signed ...
Reddy, Siva Kota, Prashanth , B., V. Lokesha, Lokesha, V., P. Siva Kota Reddy, B. Prashanth   +5 more
core   +1 more source

Sequences on Graphs with Symmetries [PDF]

, 2011
An interesting symmetry on multiplication of numbers found by Prof.Smarandache recently. By considering integers or elements in groups on graphs, we extend this symmetry on graphs and find geometrical symmetries.
Mao, Linfan, Linfan Mao
core   +1 more source

On the distance spectra of some graphs [PDF]

, 2008
The D-eigenvalues of a connected graph G are the eigenvalues of its distance matrix D, and form the D-spectrum of G. The D-energy E_{D}(G) of the graph G is the sum of the absolute values of its D-eigenvalues.
Indulal, Gopalapillai, Gopalapillai Indulal, Gutman, Ivan, Ivan Gutman   +3 more
core   +1 more source

Skew equienergetic digraphs [PDF]

, 2016
Let $D$ be a digraph with skew-adjacency matrix $S(D)$‎. ‎The skew‎ ‎energy of $D$ is defined as the sum of the norms of all‎ ‎eigenvalues of $S(D)$‎. ‎Two digraphs are said to be skew‎ ‎equienergetic if their skew energies are equal‎. ‎We establish an‎ ‎
K. Channegowda Nandeesh, Xueliang Li, Harishchandra S. Ramane, Ivan Gutman   +3 more
core  

Knot Graphs [PDF]

, 2000
We consider the equivalence classes of graphs induced by the unsigned versions of the Reidemeister moves on knot diagrams. Any graph which is reducible by some finite sequence of these moves, to a graph with no edges is called a knot graph.
Welsh, D J A, Noble, Steven, Bollobs, B, Cooper, C., Frieze, A. M., Fenner, T. I., Frieze, A.M., Welsh, D.J.A., Cooper, C, Frieze, A M, Bollobas, B., Fenner, T I, Fenner, Trevor, Noble, S D   +13 more
core   +1 more source

COMPLEMENTARY DISTANCE SPECTRA AND COMPLEMENTARY DISTANCE ENERGY OF LINE GRAPHS OF REGULAR GRAPHS

, 2016
The complementary distance (CD) matrix of a graph $G$ is defined as $CD(G) = [c_{ij}]$, where $c_{ij} = 1+D-d_{ij}$ if $i \neq j$ and $c_{ij} = 0$, otherwise, where $D$ is the diameter of $G$ and $d_{ij}$ is the distance between the vertices $v_i$ and ...
K.C. Nandeesh, Harishchandra S. Ramane
core   +1 more source

Dissecting molecular network structures using a network subgraph approach. [PDF]

PeerJ, 2020
Huang CH, Zaenudin E, Tsai JJP, Kurubanjerdjit N, Dessie EY, Ng KL.   +5 more
europepmc   +1 more source

Original scientific paper

, 2004
: The energy E(G)ofagraphGis the sum of the absolute values of the eigenvalues of G. Two graphs, G1 and G2, are said to be equienergetic if E(G1)=E(G2).
Equienergetic Chemical Trees
core  

ON DISTANCE ENERGY OF GRAPHS

, 2010
The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) is the sum of the absolute values of its D-eigenvalues. Two graphs are said to be D-equienergetic if they have the same D-energy.
Indulal,G, Gutmanb,Ivan, Vijayakumar,A
core