scholarly journals Pair difference cordiality of some graphs derived from ladder graph

Keyword(s):  
2021 ◽  
Vol 1836 (1) ◽  
pp. 012026
Author(s):  
M Y Rohmatulloh ◽  
Slamin ◽  
A I Kristiana ◽  
Dafik ◽  
R Alfarisi

1968 ◽  
Vol 167 (2) ◽  
pp. 239-244 ◽  
Author(s):  
Jouko Arponen ◽  
Pekka Jauho

2017 ◽  
Vol 855 ◽  
pp. 012037
Author(s):  
Mania Roswitha ◽  
Anna Amanda ◽  
Titin Sri Martini ◽  
Bowo Winarno
Keyword(s):  

A complete diagrammatic expansion is developed for the Domb-Joyce model of an N -step chain, with an interaction w which varies between 0 and 1. Simple rules are given for obtaining the diagrams. The correspondence between these diagrams and appropriate generating functions permits computation of the coefficients of the series α 2 N ( w ) = 1 + k 1 w + k 2 w 2 + . . ., where α 2 N ( w ) is the expansion factor of the mean square end-to-end length of the chain. The dominant term in N of each of the first three k r is shown to be identical for the three cubic lattices and for the Gaussian continuum model, with the exception of a scale factor h 0 . Retention of only this dominant term yields a ‘two-parameter’ expansion equivalent to that of Zimm (1946), Fixman (1955) and others. Diagrams are classed either as ladder or as non-ladder graphs. The ladder graph contributions are summed by using functional relations of Domb & Joyce (1972). The non-ladder contributions for the first three coefficients are computed individually, thereby yielding results for k 1 , k 2 and k 3 in terms of the ‘universal’ parameter z = h 0 N 1/2 w . The terms k 1 and k 2 agree with previous computations for the Gaussian model but k 3 differs slightly.


2019 ◽  
Vol 53 (5) ◽  
pp. 1721-1728
Author(s):  
Ayse Besirik ◽  
Elgin Kilic

The stability of a communication network has a great importance in network design. There are several vulnerability measures used to determine the resistance of network to the disruption in this sense. Domination theory provides a model to measure the vulnerability of a graph network. A new vulnerability measure of domination integrity was introduced by Sundareswaran in his Ph.D. thesis (Parameters of vulnerability in graphs (2010)) and defined as DI(G) = min{|S| + m(G − S):S ∈ V(G)} where m(G − S) denotes the order of a largest component of graph G − S and S is a dominating set of G. The domination integrity of an undirected connected graph is such a measure that works on the whole graph and also the remaining components of graph after any break down. Here we determine the domination integrity of wheel graph W1,n, Ladder graph Ln, Sm,n, Friendship graph Fn, Thorn graph of Pn and Cn which are commonly used graph models in network design.


1964 ◽  
Vol 136 (4B) ◽  
pp. B1217-B1220 ◽  
Author(s):  
George Tiktopoulos ◽  
S. B. Treiman
Keyword(s):  

1977 ◽  
Vol 18 (7) ◽  
pp. 1480-1484
Author(s):  
G. Wanders ◽  
E. Morenzoni

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
A. M. Alanazi ◽  
G. Muhiuddin ◽  
A. R. Kannan ◽  
V. Govindan

In this study, we investigate a new kind of mean labeling of graph. The ladder graph plays an important role in the area of communication networks, coding theory, and transportation engineering. Also, we found interesting new results corresponding to classical mean labeling for some ladder-related graphs and corona of ladder graphs with suitable examples.


Sign in / Sign up

Export Citation Format

Share Document