scholarly journals Connective Eccentric Index of an Infinite Family of Linear Polycene Parallelogram Benzenoid

2014 ◽  
Vol 37 ◽  
pp. 57-62
Author(s):  
Mohammad Reza Farahani
Keyword(s):  
Infinite Family ◽  
Connectivity Index ◽  
Eccentric Connectivity Index ◽  
Maximal Path ◽  
Molecular Graphs ◽  
Degree Of Vertex

Let G=(V, E) be a graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges.We defined dv denote the degree of vertex v∈V(G). The Eccentric Connectivity index ξ(G) and theConnective Eccentric index Cξ(G) of graph G are defined as ξ(G)= ∑ v∈V(G)dv x ξ(v) and Cξ(G)=ξ(G)= ∑ v∈V(G)dv x ξ(v)- where ε(v) is defined as the length of a maximal path connecting a vertex v toanother vertex of G. In this present paper, we compute these Eccentric indices for an infinite family oflinear polycene parallelogram benzenod by a new method.Keywords: Molecular graphs; Linear polycene parallelogram; Benzenoid; Eccentric connectivityindex; Connective eccentric index

Tadpole domination in duplicated graphs

2020 ◽  
pp. 2150003
Author(s):  
M. N. Al-Harere ◽  
P. A. Khuda Bakhash
Keyword(s):  
Domination Number ◽  
Hamiltonian Path ◽  
Original Graph ◽  
Maximal Path ◽  
Initial Graph

In this paper, selected domination parameters are discussed and proved especially after expanding the graph by duplicating vertices or edges. The tadpole domination number after expansion is obtained in terms of the old tadpole domination number and the maximal path of the original graph, tadpole domination number was determined for any graph after the duplication of the order of the vertices set of G or the duplication of the size of the edges set. Determining if a graph is Hamiltonian is much more problematic. Therefore, the leading outcome in this paper is that we provide that if an expanded graph (by duplicating each vertex by an edge) has tadpole domination, then the original (initial) graph has Hamiltonian path and vice versa.

On-chip generation and analysis of maximal path-frequency entanglement

CLEO: 2014 ◽  
2014 ◽  
Author(s):  
Raffaele Santagati ◽  
Joshua W. Silverstone ◽  
Damien Bonneau ◽  
Michael J. Strain ◽  
Marc Sorel ◽  
...  
Keyword(s):  
Maximal Path ◽  
On Chip

Parallelism and the maximal path problem

1987 ◽  
Vol 24 (2) ◽  
pp. 121-126 ◽  
Author(s):  
Richard Anderson ◽  
Ernst W. Mayr
Keyword(s):  
Maximal Path

scholarly journals Maximal path length of binary trees

1994 ◽  
Vol 55 (1) ◽  
pp. 15-35 ◽  
Author(s):  
Helen Cameron ◽  
Derick Wood
Keyword(s):  
Path Length ◽  
Binary Trees ◽  
Maximal Path
Sign in / Sign up

Export Citation Format

Share Document