Eintrag weiter verarbeiten
Resistance Distance in the Double Corona Based on R-Graph
Gespeichert in:
| Zeitschriftentitel: | Mathematics |
|---|---|
| Personen und Körperschaften: | , , , |
| In: | Mathematics, 7, 2019, 1, S. 92 |
| Format: | E-Article |
| Sprache: | Englisch |
| veröffentlicht: |
MDPI AG
|
| Schlagwörter: |
| author_facet |
Zhang, Li Zhao, Jing Liu, Jia-Bao Daoud, Salama Zhang, Li Zhao, Jing Liu, Jia-Bao Daoud, Salama |
|---|---|
| author |
Zhang, Li Zhao, Jing Liu, Jia-Bao Daoud, Salama |
| spellingShingle |
Zhang, Li Zhao, Jing Liu, Jia-Bao Daoud, Salama Mathematics Resistance Distance in the Double Corona Based on R-Graph General Mathematics Engineering (miscellaneous) Computer Science (miscellaneous) |
| author_sort |
zhang, li |
| spelling |
Zhang, Li Zhao, Jing Liu, Jia-Bao Daoud, Salama 2227-7390 MDPI AG General Mathematics Engineering (miscellaneous) Computer Science (miscellaneous) http://dx.doi.org/10.3390/math7010092 <jats:p>Let G 0 be a connected graph on n vertices and m edges. The R-graph R ( G 0 ) of G 0 is a graph obtained from G 0 by adding a new vertex corresponding to each edge of G 0 and by joining each new vertex to the end points of the edge corresponding to it. Let G 1 and G 2 be graphs on n 1 and n 2 vertices, respectively. The R-graph double corona G 0 ( R ) ∘ { G 1 , G 2 } of G 0 , G 1 and G 2 , is the graph obtained by taking one copy of R ( G 0 ) , n copies of G 1 and m copies of G 2 and then by joining the i-th old-vertex of R ( G 0 ) to every vertex of the i-th copy of G 1 and the j-th new vertex of R ( G 0 ) to every vertex of the j-th copy of G 2 . In this paper, we consider resistance distance in G 0 ( R ) ∘ { G 1 , G 2 } . Moreover, we give an example to illustrate the correction and efficiency of the proposed method.</jats:p> Resistance Distance in the Double Corona Based on R-Graph Mathematics |
| doi_str_mv |
10.3390/math7010092 |
| facet_avail |
Online Free |
| finc_class_facet |
Technik Informatik |
| format |
ElectronicArticle |
| fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMzM5MC9tYXRoNzAxMDA5Mg |
| id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMzM5MC9tYXRoNzAxMDA5Mg |
| institution |
DE-105 DE-14 DE-Ch1 DE-L229 DE-D275 DE-Bn3 DE-Brt1 DE-Zwi2 DE-D161 DE-Gla1 DE-Zi4 DE-15 DE-Rs1 DE-Pl11 |
| imprint |
MDPI AG, 2019 |
| imprint_str_mv |
MDPI AG, 2019 |
| issn |
2227-7390 |
| issn_str_mv |
2227-7390 |
| language |
English |
| mega_collection |
MDPI AG (CrossRef) |
| match_str |
zhang2019resistancedistanceinthedoublecoronabasedonrgraph |
| publishDateSort |
2019 |
| publisher |
MDPI AG |
| recordtype |
ai |
| record_format |
ai |
| series |
Mathematics |
| source_id |
49 |
| title |
Resistance Distance in the Double Corona Based on R-Graph |
| title_unstemmed |
Resistance Distance in the Double Corona Based on R-Graph |
| title_full |
Resistance Distance in the Double Corona Based on R-Graph |
| title_fullStr |
Resistance Distance in the Double Corona Based on R-Graph |
| title_full_unstemmed |
Resistance Distance in the Double Corona Based on R-Graph |
| title_short |
Resistance Distance in the Double Corona Based on R-Graph |
| title_sort |
resistance distance in the double corona based on r-graph |
| topic |
General Mathematics Engineering (miscellaneous) Computer Science (miscellaneous) |
| url |
http://dx.doi.org/10.3390/math7010092 |
| publishDate |
2019 |
| physical |
92 |
| description |
<jats:p>Let G 0 be a connected graph on n vertices and m edges. The R-graph R ( G 0 ) of G 0 is a graph obtained from G 0 by adding a new vertex corresponding to each edge of G 0 and by joining each new vertex to the end points of the edge corresponding to it. Let G 1 and G 2 be graphs on n 1 and n 2 vertices, respectively. The R-graph double corona G 0 ( R ) ∘ { G 1 , G 2 } of G 0 , G 1 and G 2 , is the graph obtained by taking one copy of R ( G 0 ) , n copies of G 1 and m copies of G 2 and then by joining the i-th old-vertex of R ( G 0 ) to every vertex of the i-th copy of G 1 and the j-th new vertex of R ( G 0 ) to every vertex of the j-th copy of G 2 . In this paper, we consider resistance distance in G 0 ( R ) ∘ { G 1 , G 2 } . Moreover, we give an example to illustrate the correction and efficiency of the proposed method.</jats:p> |
| container_issue |
1 |
| container_start_page |
0 |
| container_title |
Mathematics |
| container_volume |
7 |
| format_de105 |
Article, E-Article |
| format_de14 |
Article, E-Article |
| format_de15 |
Article, E-Article |
| format_de520 |
Article, E-Article |
| format_de540 |
Article, E-Article |
| format_dech1 |
Article, E-Article |
| format_ded117 |
Article, E-Article |
| format_degla1 |
E-Article |
| format_del152 |
Buch |
| format_del189 |
Article, E-Article |
| format_dezi4 |
Article |
| format_dezwi2 |
Article, E-Article |
| format_finc |
Article, E-Article |
| format_nrw |
Article, E-Article |
| _version_ |
1792328603023704071 |
| geogr_code |
not assigned |
| last_indexed |
2024-03-01T12:55:53.517Z |
| geogr_code_person |
not assigned |
| openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Resistance+Distance+in+the+Double+Corona+Based+on+R-Graph&rft.date=2019-01-17&genre=article&issn=2227-7390&volume=7&issue=1&pages=92&jtitle=Mathematics&atitle=Resistance+Distance+in+the+Double+Corona+Based+on+R-Graph&aulast=Daoud&aufirst=Salama&rft_id=info%3Adoi%2F10.3390%2Fmath7010092&rft.language%5B0%5D=eng |
| SOLR | |
| _version_ | 1792328603023704071 |
| author | Zhang, Li, Zhao, Jing, Liu, Jia-Bao, Daoud, Salama |
| author_facet | Zhang, Li, Zhao, Jing, Liu, Jia-Bao, Daoud, Salama, Zhang, Li, Zhao, Jing, Liu, Jia-Bao, Daoud, Salama |
| author_sort | zhang, li |
| container_issue | 1 |
| container_start_page | 0 |
| container_title | Mathematics |
| container_volume | 7 |
| description | <jats:p>Let G 0 be a connected graph on n vertices and m edges. The R-graph R ( G 0 ) of G 0 is a graph obtained from G 0 by adding a new vertex corresponding to each edge of G 0 and by joining each new vertex to the end points of the edge corresponding to it. Let G 1 and G 2 be graphs on n 1 and n 2 vertices, respectively. The R-graph double corona G 0 ( R ) ∘ { G 1 , G 2 } of G 0 , G 1 and G 2 , is the graph obtained by taking one copy of R ( G 0 ) , n copies of G 1 and m copies of G 2 and then by joining the i-th old-vertex of R ( G 0 ) to every vertex of the i-th copy of G 1 and the j-th new vertex of R ( G 0 ) to every vertex of the j-th copy of G 2 . In this paper, we consider resistance distance in G 0 ( R ) ∘ { G 1 , G 2 } . Moreover, we give an example to illustrate the correction and efficiency of the proposed method.</jats:p> |
| doi_str_mv | 10.3390/math7010092 |
| facet_avail | Online, Free |
| finc_class_facet | Technik, Informatik |
| format | ElectronicArticle |
| format_de105 | Article, E-Article |
| format_de14 | Article, E-Article |
| format_de15 | Article, E-Article |
| format_de520 | Article, E-Article |
| format_de540 | Article, E-Article |
| format_dech1 | Article, E-Article |
| format_ded117 | Article, E-Article |
| format_degla1 | E-Article |
| format_del152 | Buch |
| format_del189 | Article, E-Article |
| format_dezi4 | Article |
| format_dezwi2 | Article, E-Article |
| format_finc | Article, E-Article |
| format_nrw | Article, E-Article |
| geogr_code | not assigned |
| geogr_code_person | not assigned |
| id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMzM5MC9tYXRoNzAxMDA5Mg |
| imprint | MDPI AG, 2019 |
| imprint_str_mv | MDPI AG, 2019 |
| institution | DE-105, DE-14, DE-Ch1, DE-L229, DE-D275, DE-Bn3, DE-Brt1, DE-Zwi2, DE-D161, DE-Gla1, DE-Zi4, DE-15, DE-Rs1, DE-Pl11 |
| issn | 2227-7390 |
| issn_str_mv | 2227-7390 |
| language | English |
| last_indexed | 2024-03-01T12:55:53.517Z |
| match_str | zhang2019resistancedistanceinthedoublecoronabasedonrgraph |
| mega_collection | MDPI AG (CrossRef) |
| physical | 92 |
| publishDate | 2019 |
| publishDateSort | 2019 |
| publisher | MDPI AG |
| record_format | ai |
| recordtype | ai |
| series | Mathematics |
| source_id | 49 |
| spelling | Zhang, Li Zhao, Jing Liu, Jia-Bao Daoud, Salama 2227-7390 MDPI AG General Mathematics Engineering (miscellaneous) Computer Science (miscellaneous) http://dx.doi.org/10.3390/math7010092 <jats:p>Let G 0 be a connected graph on n vertices and m edges. The R-graph R ( G 0 ) of G 0 is a graph obtained from G 0 by adding a new vertex corresponding to each edge of G 0 and by joining each new vertex to the end points of the edge corresponding to it. Let G 1 and G 2 be graphs on n 1 and n 2 vertices, respectively. The R-graph double corona G 0 ( R ) ∘ { G 1 , G 2 } of G 0 , G 1 and G 2 , is the graph obtained by taking one copy of R ( G 0 ) , n copies of G 1 and m copies of G 2 and then by joining the i-th old-vertex of R ( G 0 ) to every vertex of the i-th copy of G 1 and the j-th new vertex of R ( G 0 ) to every vertex of the j-th copy of G 2 . In this paper, we consider resistance distance in G 0 ( R ) ∘ { G 1 , G 2 } . Moreover, we give an example to illustrate the correction and efficiency of the proposed method.</jats:p> Resistance Distance in the Double Corona Based on R-Graph Mathematics |
| spellingShingle | Zhang, Li, Zhao, Jing, Liu, Jia-Bao, Daoud, Salama, Mathematics, Resistance Distance in the Double Corona Based on R-Graph, General Mathematics, Engineering (miscellaneous), Computer Science (miscellaneous) |
| title | Resistance Distance in the Double Corona Based on R-Graph |
| title_full | Resistance Distance in the Double Corona Based on R-Graph |
| title_fullStr | Resistance Distance in the Double Corona Based on R-Graph |
| title_full_unstemmed | Resistance Distance in the Double Corona Based on R-Graph |
| title_short | Resistance Distance in the Double Corona Based on R-Graph |
| title_sort | resistance distance in the double corona based on r-graph |
| title_unstemmed | Resistance Distance in the Double Corona Based on R-Graph |
| topic | General Mathematics, Engineering (miscellaneous), Computer Science (miscellaneous) |
| url | http://dx.doi.org/10.3390/math7010092 |