On the rank of weighted graphs
Let be a weighted graph and be the adjacency matrix of . The rank of is the rank of . If the weight of each edge of is 1 or , is also called a signed graph. In this paper, we characterize weighted graphs with rank 2, weighted -free graphs with rank 3 and weighted graphs containing pendent vertices w...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Zhang, W. J [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2017 |
|---|
| Rechteinformationen: |
Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: Linear and multilinear algebra - Reading : Taylor & Francis, 1973, 65(2017), 3, Seite 635-652 |
|---|---|
| Übergeordnetes Werk: |
volume:65 ; year:2017 ; number:3 ; pages:635-652 |
| Links: |
|---|
| DOI / URN: |
10.1080/03081087.2016.1201039 |
|---|
| Katalog-ID: |
OLC1992459118 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1992459118 | ||
| 003 | DE-627 | ||
| 005 | 20220217011307.0 | ||
| 007 | tu | ||
| 008 | 170512s2017 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1080/03081087.2016.1201039 |2 doi | |
| 028 | 5 | 2 | |a PQ20170501 |
| 035 | |a (DE-627)OLC1992459118 | ||
| 035 | |a (DE-599)GBVOLC1992459118 | ||
| 035 | |a (PRQ)c2197-2b8025a5cc03df02676ab077da6a0735909e96b3d0efc1cff9b729cca80631ec0 | ||
| 035 | |a (KEY)0064897320170000065000300635ontherankofweightedgraphs | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |q DE-600 |
| 084 | |a 31.25 |2 bkl | ||
| 100 | 1 | |a Zhang, W. J |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a On the rank of weighted graphs |
| 264 | 1 | |c 2017 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a Let be a weighted graph and be the adjacency matrix of . The rank of is the rank of . If the weight of each edge of is 1 or , is also called a signed graph. In this paper, we characterize weighted graphs with rank 2, weighted -free graphs with rank 3 and weighted graphs containing pendent vertices with rank 4. We also characterize signed graphs with rank 4. | ||
| 540 | |a Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 | ||
| 650 | 4 | |a rank | |
| 650 | 4 | |a signed graph | |
| 650 | 4 | |a 05C50 | |
| 650 | 4 | |a Weighted graph | |
| 650 | 4 | |a Graphs | |
| 700 | 1 | |a Yu, A. M |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t Linear and multilinear algebra |d Reading : Taylor & Francis, 1973 |g 65(2017), 3, Seite 635-652 |w (DE-627)129400602 |w (DE-600)186457-9 |w (DE-576)014783029 |x 0308-1087 |7 nnns |
| 773 | 1 | 8 | |g volume:65 |g year:2017 |g number:3 |g pages:635-652 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1080/03081087.2016.1201039 |3 Volltext |
| 856 | 4 | 2 | |u http://www.tandfonline.com/doi/abs/10.1080/03081087.2016.1201039 |
| 856 | 4 | 2 | |u http://search.proquest.com/docview/1853335414 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-MAT | ||
| 936 | b | k | |a 31.25 |q AVZ |
| 951 | |a AR | ||
| 952 | |d 65 |j 2017 |e 3 |h 635-652 | ||
| author_variant |
w j z wj wjz |
|---|---|
| matchkey_str |
article:03081087:2017----::nhrnowihe |
| hierarchy_sort_str |
2017 |
| bklnumber |
31.25 |
| publishDate |
2017 |
| allfields |
10.1080/03081087.2016.1201039 doi PQ20170501 (DE-627)OLC1992459118 (DE-599)GBVOLC1992459118 (PRQ)c2197-2b8025a5cc03df02676ab077da6a0735909e96b3d0efc1cff9b729cca80631ec0 (KEY)0064897320170000065000300635ontherankofweightedgraphs DE-627 ger DE-627 rakwb eng 510 DE-600 31.25 bkl Zhang, W. J verfasserin aut On the rank of weighted graphs 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Let be a weighted graph and be the adjacency matrix of . The rank of is the rank of . If the weight of each edge of is 1 or , is also called a signed graph. In this paper, we characterize weighted graphs with rank 2, weighted -free graphs with rank 3 and weighted graphs containing pendent vertices with rank 4. We also characterize signed graphs with rank 4. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 rank signed graph 05C50 Weighted graph Graphs Yu, A. M oth Enthalten in Linear and multilinear algebra Reading : Taylor & Francis, 1973 65(2017), 3, Seite 635-652 (DE-627)129400602 (DE-600)186457-9 (DE-576)014783029 0308-1087 nnns volume:65 year:2017 number:3 pages:635-652 http://dx.doi.org/10.1080/03081087.2016.1201039 Volltext http://www.tandfonline.com/doi/abs/10.1080/03081087.2016.1201039 http://search.proquest.com/docview/1853335414 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT 31.25 AVZ AR 65 2017 3 635-652 |
| spelling |
10.1080/03081087.2016.1201039 doi PQ20170501 (DE-627)OLC1992459118 (DE-599)GBVOLC1992459118 (PRQ)c2197-2b8025a5cc03df02676ab077da6a0735909e96b3d0efc1cff9b729cca80631ec0 (KEY)0064897320170000065000300635ontherankofweightedgraphs DE-627 ger DE-627 rakwb eng 510 DE-600 31.25 bkl Zhang, W. J verfasserin aut On the rank of weighted graphs 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Let be a weighted graph and be the adjacency matrix of . The rank of is the rank of . If the weight of each edge of is 1 or , is also called a signed graph. In this paper, we characterize weighted graphs with rank 2, weighted -free graphs with rank 3 and weighted graphs containing pendent vertices with rank 4. We also characterize signed graphs with rank 4. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 rank signed graph 05C50 Weighted graph Graphs Yu, A. M oth Enthalten in Linear and multilinear algebra Reading : Taylor & Francis, 1973 65(2017), 3, Seite 635-652 (DE-627)129400602 (DE-600)186457-9 (DE-576)014783029 0308-1087 nnns volume:65 year:2017 number:3 pages:635-652 http://dx.doi.org/10.1080/03081087.2016.1201039 Volltext http://www.tandfonline.com/doi/abs/10.1080/03081087.2016.1201039 http://search.proquest.com/docview/1853335414 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT 31.25 AVZ AR 65 2017 3 635-652 |
| allfields_unstemmed |
10.1080/03081087.2016.1201039 doi PQ20170501 (DE-627)OLC1992459118 (DE-599)GBVOLC1992459118 (PRQ)c2197-2b8025a5cc03df02676ab077da6a0735909e96b3d0efc1cff9b729cca80631ec0 (KEY)0064897320170000065000300635ontherankofweightedgraphs DE-627 ger DE-627 rakwb eng 510 DE-600 31.25 bkl Zhang, W. J verfasserin aut On the rank of weighted graphs 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Let be a weighted graph and be the adjacency matrix of . The rank of is the rank of . If the weight of each edge of is 1 or , is also called a signed graph. In this paper, we characterize weighted graphs with rank 2, weighted -free graphs with rank 3 and weighted graphs containing pendent vertices with rank 4. We also characterize signed graphs with rank 4. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 rank signed graph 05C50 Weighted graph Graphs Yu, A. M oth Enthalten in Linear and multilinear algebra Reading : Taylor & Francis, 1973 65(2017), 3, Seite 635-652 (DE-627)129400602 (DE-600)186457-9 (DE-576)014783029 0308-1087 nnns volume:65 year:2017 number:3 pages:635-652 http://dx.doi.org/10.1080/03081087.2016.1201039 Volltext http://www.tandfonline.com/doi/abs/10.1080/03081087.2016.1201039 http://search.proquest.com/docview/1853335414 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT 31.25 AVZ AR 65 2017 3 635-652 |
| allfieldsGer |
10.1080/03081087.2016.1201039 doi PQ20170501 (DE-627)OLC1992459118 (DE-599)GBVOLC1992459118 (PRQ)c2197-2b8025a5cc03df02676ab077da6a0735909e96b3d0efc1cff9b729cca80631ec0 (KEY)0064897320170000065000300635ontherankofweightedgraphs DE-627 ger DE-627 rakwb eng 510 DE-600 31.25 bkl Zhang, W. J verfasserin aut On the rank of weighted graphs 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Let be a weighted graph and be the adjacency matrix of . The rank of is the rank of . If the weight of each edge of is 1 or , is also called a signed graph. In this paper, we characterize weighted graphs with rank 2, weighted -free graphs with rank 3 and weighted graphs containing pendent vertices with rank 4. We also characterize signed graphs with rank 4. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 rank signed graph 05C50 Weighted graph Graphs Yu, A. M oth Enthalten in Linear and multilinear algebra Reading : Taylor & Francis, 1973 65(2017), 3, Seite 635-652 (DE-627)129400602 (DE-600)186457-9 (DE-576)014783029 0308-1087 nnns volume:65 year:2017 number:3 pages:635-652 http://dx.doi.org/10.1080/03081087.2016.1201039 Volltext http://www.tandfonline.com/doi/abs/10.1080/03081087.2016.1201039 http://search.proquest.com/docview/1853335414 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT 31.25 AVZ AR 65 2017 3 635-652 |
| allfieldsSound |
10.1080/03081087.2016.1201039 doi PQ20170501 (DE-627)OLC1992459118 (DE-599)GBVOLC1992459118 (PRQ)c2197-2b8025a5cc03df02676ab077da6a0735909e96b3d0efc1cff9b729cca80631ec0 (KEY)0064897320170000065000300635ontherankofweightedgraphs DE-627 ger DE-627 rakwb eng 510 DE-600 31.25 bkl Zhang, W. J verfasserin aut On the rank of weighted graphs 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Let be a weighted graph and be the adjacency matrix of . The rank of is the rank of . If the weight of each edge of is 1 or , is also called a signed graph. In this paper, we characterize weighted graphs with rank 2, weighted -free graphs with rank 3 and weighted graphs containing pendent vertices with rank 4. We also characterize signed graphs with rank 4. Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016 rank signed graph 05C50 Weighted graph Graphs Yu, A. M oth Enthalten in Linear and multilinear algebra Reading : Taylor & Francis, 1973 65(2017), 3, Seite 635-652 (DE-627)129400602 (DE-600)186457-9 (DE-576)014783029 0308-1087 nnns volume:65 year:2017 number:3 pages:635-652 http://dx.doi.org/10.1080/03081087.2016.1201039 Volltext http://www.tandfonline.com/doi/abs/10.1080/03081087.2016.1201039 http://search.proquest.com/docview/1853335414 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT 31.25 AVZ AR 65 2017 3 635-652 |
| language |
English |
| source |
Enthalten in Linear and multilinear algebra 65(2017), 3, Seite 635-652 volume:65 year:2017 number:3 pages:635-652 |
| sourceStr |
Enthalten in Linear and multilinear algebra 65(2017), 3, Seite 635-652 volume:65 year:2017 number:3 pages:635-652 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
rank signed graph 05C50 Weighted graph Graphs |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Linear and multilinear algebra |
| authorswithroles_txt_mv |
Zhang, W. J @@aut@@ Yu, A. M @@oth@@ |
| publishDateDaySort_date |
2017-01-01T00:00:00Z |
| hierarchy_top_id |
129400602 |
| dewey-sort |
3510 |
| id |
OLC1992459118 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1992459118</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220217011307.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">170512s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/03081087.2016.1201039</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20170501</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1992459118</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1992459118</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c2197-2b8025a5cc03df02676ab077da6a0735909e96b3d0efc1cff9b729cca80631ec0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0064897320170000065000300635ontherankofweightedgraphs</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.25</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhang, W. J</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the rank of weighted graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Let be a weighted graph and be the adjacency matrix of . The rank of is the rank of . If the weight of each edge of is 1 or , is also called a signed graph. In this paper, we characterize weighted graphs with rank 2, weighted -free graphs with rank 3 and weighted graphs containing pendent vertices with rank 4. We also characterize signed graphs with rank 4.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">rank</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">signed graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">05C50</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Weighted graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphs</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yu, A. M</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Linear and multilinear algebra</subfield><subfield code="d">Reading : Taylor & Francis, 1973</subfield><subfield code="g">65(2017), 3, Seite 635-652</subfield><subfield code="w">(DE-627)129400602</subfield><subfield code="w">(DE-600)186457-9</subfield><subfield code="w">(DE-576)014783029</subfield><subfield code="x">0308-1087</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:65</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:635-652</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1080/03081087.2016.1201039</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.tandfonline.com/doi/abs/10.1080/03081087.2016.1201039</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1853335414</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.25</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">65</subfield><subfield code="j">2017</subfield><subfield code="e">3</subfield><subfield code="h">635-652</subfield></datafield></record></collection>
|
| author |
Zhang, W. J |
| spellingShingle |
Zhang, W. J ddc 510 bkl 31.25 misc rank misc signed graph misc 05C50 misc Weighted graph misc Graphs On the rank of weighted graphs |
| authorStr |
Zhang, W. J |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129400602 |
| format |
Article |
| dewey-ones |
510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0308-1087 |
| topic_title |
510 DE-600 31.25 bkl On the rank of weighted graphs rank signed graph 05C50 Weighted graph Graphs |
| topic |
ddc 510 bkl 31.25 misc rank misc signed graph misc 05C50 misc Weighted graph misc Graphs |
| topic_unstemmed |
ddc 510 bkl 31.25 misc rank misc signed graph misc 05C50 misc Weighted graph misc Graphs |
| topic_browse |
ddc 510 bkl 31.25 misc rank misc signed graph misc 05C50 misc Weighted graph misc Graphs |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
a m y am amy |
| hierarchy_parent_title |
Linear and multilinear algebra |
| hierarchy_parent_id |
129400602 |
| dewey-tens |
510 - Mathematics |
| hierarchy_top_title |
Linear and multilinear algebra |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129400602 (DE-600)186457-9 (DE-576)014783029 |
| title |
On the rank of weighted graphs |
| ctrlnum |
(DE-627)OLC1992459118 (DE-599)GBVOLC1992459118 (PRQ)c2197-2b8025a5cc03df02676ab077da6a0735909e96b3d0efc1cff9b729cca80631ec0 (KEY)0064897320170000065000300635ontherankofweightedgraphs |
| title_full |
On the rank of weighted graphs |
| author_sort |
Zhang, W. J |
| journal |
Linear and multilinear algebra |
| journalStr |
Linear and multilinear algebra |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2017 |
| contenttype_str_mv |
txt |
| container_start_page |
635 |
| author_browse |
Zhang, W. J |
| container_volume |
65 |
| class |
510 DE-600 31.25 bkl |
| format_se |
Aufsätze |
| author-letter |
Zhang, W. J |
| doi_str_mv |
10.1080/03081087.2016.1201039 |
| dewey-full |
510 |
| title_sort |
on the rank of weighted graphs |
| title_auth |
On the rank of weighted graphs |
| abstract |
Let be a weighted graph and be the adjacency matrix of . The rank of is the rank of . If the weight of each edge of is 1 or , is also called a signed graph. In this paper, we characterize weighted graphs with rank 2, weighted -free graphs with rank 3 and weighted graphs containing pendent vertices with rank 4. We also characterize signed graphs with rank 4. |
| abstractGer |
Let be a weighted graph and be the adjacency matrix of . The rank of is the rank of . If the weight of each edge of is 1 or , is also called a signed graph. In this paper, we characterize weighted graphs with rank 2, weighted -free graphs with rank 3 and weighted graphs containing pendent vertices with rank 4. We also characterize signed graphs with rank 4. |
| abstract_unstemmed |
Let be a weighted graph and be the adjacency matrix of . The rank of is the rank of . If the weight of each edge of is 1 or , is also called a signed graph. In this paper, we characterize weighted graphs with rank 2, weighted -free graphs with rank 3 and weighted graphs containing pendent vertices with rank 4. We also characterize signed graphs with rank 4. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT |
| container_issue |
3 |
| title_short |
On the rank of weighted graphs |
| url |
http://dx.doi.org/10.1080/03081087.2016.1201039 http://www.tandfonline.com/doi/abs/10.1080/03081087.2016.1201039 http://search.proquest.com/docview/1853335414 |
| remote_bool |
false |
| author2 |
Yu, A. M |
| author2Str |
Yu, A. M |
| ppnlink |
129400602 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth |
| doi_str |
10.1080/03081087.2016.1201039 |
| up_date |
2024-07-04T04:59:39.048Z |
| _version_ |
1803623259479998464 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1992459118</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220217011307.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">170512s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/03081087.2016.1201039</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20170501</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1992459118</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1992459118</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c2197-2b8025a5cc03df02676ab077da6a0735909e96b3d0efc1cff9b729cca80631ec0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0064897320170000065000300635ontherankofweightedgraphs</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.25</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhang, W. J</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the rank of weighted graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Let be a weighted graph and be the adjacency matrix of . The rank of is the rank of . If the weight of each edge of is 1 or , is also called a signed graph. In this paper, we characterize weighted graphs with rank 2, weighted -free graphs with rank 3 and weighted graphs containing pendent vertices with rank 4. We also characterize signed graphs with rank 4.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © 2016 Informa UK Limited, trading as Taylor & Francis Group 2016</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">rank</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">signed graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">05C50</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Weighted graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphs</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yu, A. M</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Linear and multilinear algebra</subfield><subfield code="d">Reading : Taylor & Francis, 1973</subfield><subfield code="g">65(2017), 3, Seite 635-652</subfield><subfield code="w">(DE-627)129400602</subfield><subfield code="w">(DE-600)186457-9</subfield><subfield code="w">(DE-576)014783029</subfield><subfield code="x">0308-1087</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:65</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:635-652</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1080/03081087.2016.1201039</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.tandfonline.com/doi/abs/10.1080/03081087.2016.1201039</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1853335414</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.25</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">65</subfield><subfield code="j">2017</subfield><subfield code="e">3</subfield><subfield code="h">635-652</subfield></datafield></record></collection>
|
| score |
7.4010954 |