Connectivity measures in matched sum graphs |
| |
| Authors: | C Balbuena |
| |
| Institution: | a Departament de Matemàtica Aplicada III, Universitat Politècnica de Catalunya, Campus Nord, Edifici C2, C/ Jordi Girona 1 i 3, E-08034 Barcelona, Spain
b Departamento de Matemática Aplicada I, Universidad de Sevilla, Avda Reina Mercedes 2, E-41012 Sevilla, Spain |
| |
| Abstract: | A matched sum graph G of two graphs G1 and G2 of the same order is obtained from the union of G1 and G2 and from joining each vertex of G1 with one vertex of G2 according to one bijection f between the vertices in V(G1) and V(G2). When G1=G2=H then f is just a permutation of V(H) and the corresponding matched sum graph is a permutation graph Hf. In this paper, we derive lower bounds for the connectivity, edge-connectivity, and different conditional connectivities in matched sum graphs, and present sufficient conditions which guarantee maximum values for these conditional connectivities. |
| |
| Keywords: | Restricted edge-cut Restricted cut Connectivity Conditional connectivity Superconnectivity Restricted connectivity |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
