مرور Volume 1, Issue 4 بر اساس عنوان
در حال نمایش موارد 1 - 7 از 7
- 
Determinants of adjacency matrices of graphs (University of Isfahan, 2012-12-01)We study the set of all determinants of adjacency matrices of graphs with a given number of vertices. Using Brendan McKay's data base of small graphs, determinants of graphs with at most $9$ vertices are computed so ...
 
- 
Hosoya and Merrifield-Simmons indices of some classes of corona of two graphs (University of Isfahan, 2012-12-01)Let $G=(V,E)$ be a simple graph of order $n$ and size $m$. An $r$-matching of $G$ is a set of $r$ edges of $G$ which no two of them have common vertex. The Hosoya index $Z(G)$ of a graph $G$ is defined as the total ...
 
- 
The Hosoya index and the Merrifield-Simmons index of some graphs (University of Isfahan, 2012-12-01)The Hosoya index and the Merrifield-Simmons index are two types of graph invariants used in mathematical chemistry. In this paper, we give some formulas to compute these indices for some classes of corona product ...
 
- 
On a relation between Szeged and Wiener indices of bipartite graphs (University of Isfahan, 2012-12-01)Hansen et. al., using the AutoGraphiX software package, conjectured that the Szeged index $Sz(G)$ and the Wiener index $W(G)$ of a connected bipartite graph $G$ with $n geq 4$ vertices and $m geq n$ edges, ...
 
- 
On label graphoidal covering number-I (University of Isfahan, 2012-12-01)Let $G=(V, E)$ be a graph with $p$ vertices and $q$ edges. An acyclic graphoidal cover of $G$ is a collection $psi$ of paths in $G$ which are internally-disjoint and cover each edge of the graph exactly ...
 
- 
A simple approach to order the multiplicative Zagreb indices of connected graphs (University of Isfahan, 2012-12-01)The first ($Pi_1$) and the second $(Pi_2$) multiplicative Zagreb indices of a connected graph $G$, with vertex set $V(G)$ and edge set $E(G)$, are defined as $Pi_1(G) = prod_{u in V(G)} {d_u}^2$ and $Pi_2(G) = ...
 
- 
Toeplitz graph decomposition (University of Isfahan, 2012-12-01)Let $n,,t_1,,ldots,,t_k$ be distinct positive integers. A Toeplitz graph $G=(V, E)$ is a graph with $V ={1,ldots,n}$ and $E= {(i,j)mid |i-j|in {t_1,ldots,t_k}}$. In this paper, we present some results on ...
 



