Paper Info

Title | ||
---|---|---|

Resistance distance in complete n-partite graphs. |

Abstract | ||
---|---|---|

We may view any graph as a network of resistors each having a resistance of 1 Ω. The resistance distance between a pair of vertices in a graph is defined as the effective resistance between the two vertices. This function is known to be a metric on the vertex-set of any graph. The main result of this paper is an explicit expression for the resistance distance between any pair of vertices in the complete n-partite graph Km1,m2,…,mn. |

Year | DOI | Venue |
---|---|---|

2016 | 10.1016/j.dam.2015.09.017 | Discrete Applied Mathematics |

Keywords | Field | DocType |

Resistance,Resistors in series or parallel,Kirchoff’s laws,Complete n-partite graph | Wheel graph,Complete graph,Discrete mathematics,Combinatorics,Graph power,Cycle graph,Distance,Distance-regular graph,Resistance distance,Mathematics,Complement graph | Journal |

Volume | ISSN | Citations |

203 | 0166-218X | 4 |

PageRank | References | Authors |

0.68 | 1 | 1 |

Authors (1 rows)

Cited by (4 rows)

References (1 rows)

Name | Order | Citations | PageRank |
---|---|---|---|

Severino V. Gervacio | 1 | 22 | 6.38 |