Note on Full Signed Graphs and Full Line Signed Graphs
In this paper, we introduced the new notions full signed graph and full line signed graph of a signed graph and its properties are obtained. Also, we obtained the structural characterizations of these notions. Further, we presented some interesting switching equivalent characterizations.
Gespeichert in:
| Veröffentlicht in: | International journal of mathematical combinatorics 2023-03, Vol.1, p.74-80 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 80 |
|---|---|
| container_issue | |
| container_start_page | 74 |
| container_title | International journal of mathematical combinatorics |
| container_volume | 1 |
| creator | Swamy Somashekar, P Alloush, Khaled A A |
| description | In this paper, we introduced the new notions full signed graph and full line signed graph of a signed graph and its properties are obtained. Also, we obtained the structural characterizations of these notions. Further, we presented some interesting switching equivalent characterizations. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2865885622</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2806183926</sourcerecordid><originalsourceid>FETCH-LOGICAL-p562-268bc5e6ac93ae3bf810a883c1c2f8e51f9cb72ab7b43439648ffe29901a1b63</originalsourceid><addsrcrecordid>eNp9jU9rAjEUxENpQWv9DoGeF5K85O3LsUi1hUUPepckJv5hyW437vevYCn00tMMM8P8HthUWqgrKXT9-OuNmbDnUi5CGAuapgzX3TXyLvPl2LZ8ez7meOCrwfWnwl0-3OPmnOPf7oU9JdeWOP_RGdsu33eLj6rZrD4Xb03VG1SVQvLBRHTBgovgE0nhiCDIoBJFI5MNvlbO116DBouaUorKWiGd9Agz9np_7Yfua4zlur9045BvwL0iNEQ3iPp_JVASWIXwDdxKTGs</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2806183926</pqid></control><display><type>article</type><title>Note on Full Signed Graphs and Full Line Signed Graphs</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>Swamy ; Somashekar, P ; Alloush, Khaled A A</creator><creatorcontrib>Swamy ; Somashekar, P ; Alloush, Khaled A A</creatorcontrib><description>In this paper, we introduced the new notions full signed graph and full line signed graph of a signed graph and its properties are obtained. Also, we obtained the structural characterizations of these notions. Further, we presented some interesting switching equivalent characterizations.</description><identifier>ISSN: 1937-1055</identifier><identifier>EISSN: 1937-1047</identifier><language>eng</language><publisher>Gallup: Science Seeking - distributor</publisher><subject>Graphs ; Signs</subject><ispartof>International journal of mathematical combinatorics, 2023-03, Vol.1, p.74-80</ispartof><rights>2023. This work is published under http://fs.unm.edu/IJMC.htm (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780</link.rule.ids></links><search><creatorcontrib>Swamy</creatorcontrib><creatorcontrib>Somashekar, P</creatorcontrib><creatorcontrib>Alloush, Khaled A A</creatorcontrib><title>Note on Full Signed Graphs and Full Line Signed Graphs</title><title>International journal of mathematical combinatorics</title><description>In this paper, we introduced the new notions full signed graph and full line signed graph of a signed graph and its properties are obtained. Also, we obtained the structural characterizations of these notions. Further, we presented some interesting switching equivalent characterizations.</description><subject>Graphs</subject><subject>Signs</subject><issn>1937-1055</issn><issn>1937-1047</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp9jU9rAjEUxENpQWv9DoGeF5K85O3LsUi1hUUPepckJv5hyW437vevYCn00tMMM8P8HthUWqgrKXT9-OuNmbDnUi5CGAuapgzX3TXyLvPl2LZ8ez7meOCrwfWnwl0-3OPmnOPf7oU9JdeWOP_RGdsu33eLj6rZrD4Xb03VG1SVQvLBRHTBgovgE0nhiCDIoBJFI5MNvlbO116DBouaUorKWiGd9Agz9np_7Yfua4zlur9045BvwL0iNEQ3iPp_JVASWIXwDdxKTGs</recordid><startdate>20230301</startdate><enddate>20230301</enddate><creator>Swamy</creator><creator>Somashekar, P</creator><creator>Alloush, Khaled A A</creator><general>Science Seeking - distributor</general><scope>3V.</scope><scope>4T-</scope><scope>4U-</scope><scope>7SC</scope><scope>7TB</scope><scope>7XB</scope><scope>88I</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>KR7</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>20230301</creationdate><title>Note on Full Signed Graphs and Full Line Signed Graphs</title><author>Swamy ; Somashekar, P ; Alloush, Khaled A A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p562-268bc5e6ac93ae3bf810a883c1c2f8e51f9cb72ab7b43439648ffe29901a1b63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Graphs</topic><topic>Signs</topic><toplevel>online_resources</toplevel><creatorcontrib>Swamy</creatorcontrib><creatorcontrib>Somashekar, P</creatorcontrib><creatorcontrib>Alloush, Khaled A A</creatorcontrib><collection>ProQuest Central (Corporate)</collection><collection>Docstoc</collection><collection>University Readers</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>International journal of mathematical combinatorics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Swamy</au><au>Somashekar, P</au><au>Alloush, Khaled A A</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Note on Full Signed Graphs and Full Line Signed Graphs</atitle><jtitle>International journal of mathematical combinatorics</jtitle><date>2023-03-01</date><risdate>2023</risdate><volume>1</volume><spage>74</spage><epage>80</epage><pages>74-80</pages><issn>1937-1055</issn><eissn>1937-1047</eissn><abstract>In this paper, we introduced the new notions full signed graph and full line signed graph of a signed graph and its properties are obtained. Also, we obtained the structural characterizations of these notions. Further, we presented some interesting switching equivalent characterizations.</abstract><cop>Gallup</cop><pub>Science Seeking - distributor</pub><tpages>7</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1937-1055 |
| ispartof | International journal of mathematical combinatorics, 2023-03, Vol.1, p.74-80 |
| issn | 1937-1055 1937-1047 |
| language | eng |
| recordid | cdi_proquest_journals_2865885622 |
| source | EZB-FREE-00999 freely available EZB journals |
| subjects | Graphs Signs |
| title | Note on Full Signed Graphs and Full Line Signed Graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T00%3A21%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Note%20on%20Full%20Signed%20Graphs%20and%20Full%20Line%20Signed%20Graphs&rft.jtitle=International%20journal%20of%20mathematical%20combinatorics&rft.au=Swamy&rft.date=2023-03-01&rft.volume=1&rft.spage=74&rft.epage=80&rft.pages=74-80&rft.issn=1937-1055&rft.eissn=1937-1047&rft_id=info:doi/&rft_dat=%3Cproquest%3E2806183926%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2806183926&rft_id=info:pmid/&rfr_iscdi=true |