On similarity of distances in graphs
A vertex v ∈ V(G) that lies at the same distance from at least two distinct vertices u and w is said to be a distance similar vertex with respect to u and w. A set S ⊂ V(G) of vertices is said to be a distance similar set when each v ∈ S is distance similar to all vertices in V(G) - S. Maximum cardi...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | 1 |
| container_start_page | |
| container_title | |
| container_volume | 2112 |
| creator | Anuradha, A. Swathi, S. |
| description | A vertex v ∈ V(G) that lies at the same distance from at least two distinct vertices u and w is said to be a distance similar vertex with respect to u and w. A set S ⊂ V(G) of vertices is said to be a distance similar set when each v ∈ S is distance similar to all vertices in V(G) - S. Maximum cardinality of a non-trivial distance similar set is called the distance similar number of graph G and is denoted as ds(G). This paper aims to evaluate ds(G) for some special family of graphs. |
| doi_str_mv | 10.1063/1.5112283 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>proquest_scita</sourceid><recordid>TN_cdi_proquest_journals_2245909983</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2245909983</sourcerecordid><originalsourceid>FETCH-LOGICAL-p288t-c320e8a605273915271817f52656b7afe01281b0453cfe0da31d7aa83cfdb0803</originalsourceid><addsrcrecordid>eNp9kE1LAzEYhIMoWKsH_8GCnoSt7_tm83WUYlUo9KLgLWS_NKXdXZNU6L93pQVvXmYYeJiBYewaYYYg-T3OBCKR5idsgkJgriTKUzYBMEVOBX8_ZxcxrgHIKKUn7HbVZdFv_cYFn_ZZ32a1j8l1VRMz32UfwQ2f8ZKdtW4Tm6ujT9nb4vF1_pwvV08v84dlPpDWKa84QaOdBEGKGxwVNapWkBSyVK5tAEljCYXg1Rhqx7FWzukx1SVo4FN2c-gdQv-1a2Ky634XunHSEhXCgDGaj9TdgYqVTy75vrND8FsX9hbB_r5g0R5f-A_-7sMfaIe65T_8T1rV</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>2245909983</pqid></control><display><type>conference_proceeding</type><title>On similarity of distances in graphs</title><source>AIP Journals Complete</source><creator>Anuradha, A. ; Swathi, S.</creator><contributor>Govindarajan, A. ; Sangeetha, S. ; Sambath, P.</contributor><creatorcontrib>Anuradha, A. ; Swathi, S. ; Govindarajan, A. ; Sangeetha, S. ; Sambath, P.</creatorcontrib><description>A vertex v ∈ V(G) that lies at the same distance from at least two distinct vertices u and w is said to be a distance similar vertex with respect to u and w. A set S ⊂ V(G) of vertices is said to be a distance similar set when each v ∈ S is distance similar to all vertices in V(G) - S. Maximum cardinality of a non-trivial distance similar set is called the distance similar number of graph G and is denoted as ds(G). This paper aims to evaluate ds(G) for some special family of graphs.</description><identifier>ISSN: 0094-243X</identifier><identifier>EISSN: 1551-7616</identifier><identifier>DOI: 10.1063/1.5112283</identifier><identifier>CODEN: APCPCS</identifier><language>eng</language><publisher>Melville: American Institute of Physics</publisher><subject>Apexes ; Graphs</subject><ispartof>AIP Conference Proceedings, 2019, Vol.2112 (1)</ispartof><rights>Author(s)</rights><rights>2019 Author(s). Published by AIP Publishing.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://pubs.aip.org/acp/article-lookup/doi/10.1063/1.5112283$$EHTML$$P50$$Gscitation$$H</linktohtml><link.rule.ids>309,310,314,780,784,789,790,794,4512,23930,23931,25140,27924,27925,76384</link.rule.ids></links><search><contributor>Govindarajan, A.</contributor><contributor>Sangeetha, S.</contributor><contributor>Sambath, P.</contributor><creatorcontrib>Anuradha, A.</creatorcontrib><creatorcontrib>Swathi, S.</creatorcontrib><title>On similarity of distances in graphs</title><title>AIP Conference Proceedings</title><description>A vertex v ∈ V(G) that lies at the same distance from at least two distinct vertices u and w is said to be a distance similar vertex with respect to u and w. A set S ⊂ V(G) of vertices is said to be a distance similar set when each v ∈ S is distance similar to all vertices in V(G) - S. Maximum cardinality of a non-trivial distance similar set is called the distance similar number of graph G and is denoted as ds(G). This paper aims to evaluate ds(G) for some special family of graphs.</description><subject>Apexes</subject><subject>Graphs</subject><issn>0094-243X</issn><issn>1551-7616</issn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2019</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNp9kE1LAzEYhIMoWKsH_8GCnoSt7_tm83WUYlUo9KLgLWS_NKXdXZNU6L93pQVvXmYYeJiBYewaYYYg-T3OBCKR5idsgkJgriTKUzYBMEVOBX8_ZxcxrgHIKKUn7HbVZdFv_cYFn_ZZ32a1j8l1VRMz32UfwQ2f8ZKdtW4Tm6ujT9nb4vF1_pwvV08v84dlPpDWKa84QaOdBEGKGxwVNapWkBSyVK5tAEljCYXg1Rhqx7FWzukx1SVo4FN2c-gdQv-1a2Ky634XunHSEhXCgDGaj9TdgYqVTy75vrND8FsX9hbB_r5g0R5f-A_-7sMfaIe65T_8T1rV</recordid><startdate>20190621</startdate><enddate>20190621</enddate><creator>Anuradha, A.</creator><creator>Swathi, S.</creator><general>American Institute of Physics</general><scope>8FD</scope><scope>H8D</scope><scope>L7M</scope></search><sort><creationdate>20190621</creationdate><title>On similarity of distances in graphs</title><author>Anuradha, A. ; Swathi, S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p288t-c320e8a605273915271817f52656b7afe01281b0453cfe0da31d7aa83cfdb0803</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Apexes</topic><topic>Graphs</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Anuradha, A.</creatorcontrib><creatorcontrib>Swathi, S.</creatorcontrib><collection>Technology Research Database</collection><collection>Aerospace Database</collection><collection>Advanced Technologies Database with Aerospace</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Anuradha, A.</au><au>Swathi, S.</au><au>Govindarajan, A.</au><au>Sangeetha, S.</au><au>Sambath, P.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On similarity of distances in graphs</atitle><btitle>AIP Conference Proceedings</btitle><date>2019-06-21</date><risdate>2019</risdate><volume>2112</volume><issue>1</issue><issn>0094-243X</issn><eissn>1551-7616</eissn><coden>APCPCS</coden><abstract>A vertex v ∈ V(G) that lies at the same distance from at least two distinct vertices u and w is said to be a distance similar vertex with respect to u and w. A set S ⊂ V(G) of vertices is said to be a distance similar set when each v ∈ S is distance similar to all vertices in V(G) - S. Maximum cardinality of a non-trivial distance similar set is called the distance similar number of graph G and is denoted as ds(G). This paper aims to evaluate ds(G) for some special family of graphs.</abstract><cop>Melville</cop><pub>American Institute of Physics</pub><doi>10.1063/1.5112283</doi><tpages>4</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0094-243X |
| ispartof | AIP Conference Proceedings, 2019, Vol.2112 (1) |
| issn | 0094-243X 1551-7616 |
| language | eng |
| recordid | cdi_proquest_journals_2245909983 |
| source | AIP Journals Complete |
| subjects | Apexes Graphs |
| title | On similarity of distances in graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T04%3A10%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_scita&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=On%20similarity%20of%20distances%20in%20graphs&rft.btitle=AIP%20Conference%20Proceedings&rft.au=Anuradha,%20A.&rft.date=2019-06-21&rft.volume=2112&rft.issue=1&rft.issn=0094-243X&rft.eissn=1551-7616&rft.coden=APCPCS&rft_id=info:doi/10.1063/1.5112283&rft_dat=%3Cproquest_scita%3E2245909983%3C/proquest_scita%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2245909983&rft_id=info:pmid/&rfr_iscdi=true |