Search Results - "Behmaram, A."

Dominating induced matchings and other graph parameters by Mahmoodi, A., Behmaram, A., Došlić, T., Asadi, N.

“…A matching M in a graph G is an induced matching if the largest degree of the subgraph of G induced by M is equal to one. A dominating induced matching (DIM)…”
Get full text

Some Results on Dominating Induced Matchings by Akbari, S., Baktash, H., Behjati, A., Behmaram, A., Roghani, M.

“…Let G be a graph, a dominating induced matching (DIM) of G is an induced matching that dominates every edge of G . In this paper we show that if a graph G has…”
Get full text

Signless Laplacian Determination for a Family of Double Starlike Trees by Sharafdini, R., Abdian, A. Z., Behmaram, A.

“…Two graphs are said to be Q -cospectral if they have the same signless Laplacian spectrum. A graph is said to be DQS if there are no other nonisomorphic graphs…”
Get full text

Wiener polarity index of fullerenes and hexagonal systems by Behmaram, A., Yousefi-Azari, H., Ashrafi, A.R.

“…The Wiener polarity index Wp(G) of a molecular graph G of order n is the number of unordered pairs of vertices u, v of G such that the distance dG(u,v) between…”
Get full text

Closed formulas for the number of small paths, independent sets and matchings in fullerenes by Behmaram, A., Yousefi-Azari, H., Ashrafi, A.R.

“…Fullerene graphs are 3-regular planar graphs whose faces are pentagons or hexagons. In this paper, we first compute the number of paths of low order in a…”
Get full text