On the radius of neighborhood graphs

The k-step graph of a graph G has the same vertex set as G and two vertices are adjacent in if and only if there exists a path of length k connecting them in G. The graph is called the neighborhood graph of G. We present results on the connectivity and the radius of k-step graphs, especially on the...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Mukwembi, Simon [verfasserIn] Vetrík, Tomáš

Format:	Artikel
Sprache:	Englisch

Erschienen:	2016

Rechteinformationen:	Nutzungsrecht: © 2016 NISC (Pty) Ltd 2016

Schlagwörter:	Neighborhood graph 05C12 radius 05C35 k-step graph Neighborhoods Graphs

Übergeordnetes Werk:	Enthalten in: Quaestiones mathematicae - Grahamstown : NISC, 1976, 39(2016), 5, Seite 577-585
Übergeordnetes Werk:	volume:39 ; year:2016 ; number:5 ; pages:577-585

Links:	Volltext Link aufrufen Link aufrufen

DOI / URN:	10.2989/16073606.2015.1113211

Katalog-ID:	OLC198157381X

Internformat


LEADER	01000caa a2200265 4500
001	OLC198157381X
003	DE-627
005	20220215183127.0
007	tu
008	161013s2016 xx \|\|\|\|\| 00\| \|\|eng c
024	7		\|a 10.2989/16073606.2015.1113211 \|2 doi
028	5	2	\|a PQ20161201
035			\|a (DE-627)OLC198157381X
035			\|a (DE-599)GBVOLC198157381X
035			\|a (PRQ)c1543-7c179b584a45b874d230639d03a2f5152e63e6178b2177754da5bd3125e677a30
035			\|a (KEY)0036642020160000039000500577ontheradiusofneighborhoodgraphs
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
082	0	4	\|a 510 \|q DNB
084			\|a 31.00 \|2 bkl
100	1		\|a Mukwembi, Simon \|e verfasserin \|4 aut
245	1	0	\|a On the radius of neighborhood graphs
264		1	\|c 2016
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 The k-step graph of a graph G has the same vertex set as G and two vertices are adjacent in if and only if there exists a path of length k connecting them in G. The graph is called the neighborhood graph of G. We present results on the connectivity and the radius of k-step graphs, especially on the radius of neighborhood graphs. For connected graphs we state bounds on the radius of in terms of the radius of G and we show that the bounds are sharp. For disconnected graphs , we give exact values of the radii of components of .
540			\|a Nutzungsrecht: © 2016 NISC (Pty) Ltd 2016
650		4	\|a Neighborhood graph
650		4	\|a 05C12
650		4	\|a radius
650		4	\|a 05C35
650		4	\|a k-step graph
650		4	\|a Neighborhoods
650		4	\|a Graphs
700	1		\|a Vetrík, Tomáš \|4 oth
773	0	8	\|i Enthalten in \|t Quaestiones mathematicae \|d Grahamstown : NISC, 1976 \|g 39(2016), 5, Seite 577-585 \|w (DE-627)130059420 \|w (DE-600)438350-3 \|w (DE-576)015596125 \|x 0379-9468 \|7 nnns
773	1	8	\|g volume:39 \|g year:2016 \|g number:5 \|g pages:577-585
856	4	1	\|u http://dx.doi.org/10.2989/16073606.2015.1113211 \|3 Volltext
856	4	2	\|u http://www.tandfonline.com/doi/abs/10.2989/16073606.2015.1113211
856	4	2	\|u http://search.proquest.com/docview/1816172575
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-MAT
912			\|a SSG-OPC-MAT
912			\|a GBV_ILN_70
912			\|a GBV_ILN_2088
912			\|a GBV_ILN_4318
936	b	k	\|a 31.00 \|q AVZ
951			\|a AR
952			\|d 39 \|j 2016 \|e 5 \|h 577-585

Indexfelder

author_variant	s m sm
matchkey_str	article:03799468:2016----::nhrduoniho
hierarchy_sort_str	2016
bklnumber	31.00
publishDate	2016
allfields	10.2989/16073606.2015.1113211 doi PQ20161201 (DE-627)OLC198157381X (DE-599)GBVOLC198157381X (PRQ)c1543-7c179b584a45b874d230639d03a2f5152e63e6178b2177754da5bd3125e677a30 (KEY)0036642020160000039000500577ontheradiusofneighborhoodgraphs DE-627 ger DE-627 rakwb eng 510 DNB 31.00 bkl Mukwembi, Simon verfasserin aut On the radius of neighborhood graphs 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The k-step graph of a graph G has the same vertex set as G and two vertices are adjacent in if and only if there exists a path of length k connecting them in G. The graph is called the neighborhood graph of G. We present results on the connectivity and the radius of k-step graphs, especially on the radius of neighborhood graphs. For connected graphs we state bounds on the radius of in terms of the radius of G and we show that the bounds are sharp. For disconnected graphs , we give exact values of the radii of components of . Nutzungsrecht: © 2016 NISC (Pty) Ltd 2016 Neighborhood graph 05C12 radius 05C35 k-step graph Neighborhoods Graphs Vetrík, Tomáš oth Enthalten in Quaestiones mathematicae Grahamstown : NISC, 1976 39(2016), 5, Seite 577-585 (DE-627)130059420 (DE-600)438350-3 (DE-576)015596125 0379-9468 nnns volume:39 year:2016 number:5 pages:577-585 http://dx.doi.org/10.2989/16073606.2015.1113211 Volltext http://www.tandfonline.com/doi/abs/10.2989/16073606.2015.1113211 http://search.proquest.com/docview/1816172575 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_2088 GBV_ILN_4318 31.00 AVZ AR 39 2016 5 577-585
spelling	10.2989/16073606.2015.1113211 doi PQ20161201 (DE-627)OLC198157381X (DE-599)GBVOLC198157381X (PRQ)c1543-7c179b584a45b874d230639d03a2f5152e63e6178b2177754da5bd3125e677a30 (KEY)0036642020160000039000500577ontheradiusofneighborhoodgraphs DE-627 ger DE-627 rakwb eng 510 DNB 31.00 bkl Mukwembi, Simon verfasserin aut On the radius of neighborhood graphs 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The k-step graph of a graph G has the same vertex set as G and two vertices are adjacent in if and only if there exists a path of length k connecting them in G. The graph is called the neighborhood graph of G. We present results on the connectivity and the radius of k-step graphs, especially on the radius of neighborhood graphs. For connected graphs we state bounds on the radius of in terms of the radius of G and we show that the bounds are sharp. For disconnected graphs , we give exact values of the radii of components of . Nutzungsrecht: © 2016 NISC (Pty) Ltd 2016 Neighborhood graph 05C12 radius 05C35 k-step graph Neighborhoods Graphs Vetrík, Tomáš oth Enthalten in Quaestiones mathematicae Grahamstown : NISC, 1976 39(2016), 5, Seite 577-585 (DE-627)130059420 (DE-600)438350-3 (DE-576)015596125 0379-9468 nnns volume:39 year:2016 number:5 pages:577-585 http://dx.doi.org/10.2989/16073606.2015.1113211 Volltext http://www.tandfonline.com/doi/abs/10.2989/16073606.2015.1113211 http://search.proquest.com/docview/1816172575 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_2088 GBV_ILN_4318 31.00 AVZ AR 39 2016 5 577-585
allfields_unstemmed	10.2989/16073606.2015.1113211 doi PQ20161201 (DE-627)OLC198157381X (DE-599)GBVOLC198157381X (PRQ)c1543-7c179b584a45b874d230639d03a2f5152e63e6178b2177754da5bd3125e677a30 (KEY)0036642020160000039000500577ontheradiusofneighborhoodgraphs DE-627 ger DE-627 rakwb eng 510 DNB 31.00 bkl Mukwembi, Simon verfasserin aut On the radius of neighborhood graphs 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The k-step graph of a graph G has the same vertex set as G and two vertices are adjacent in if and only if there exists a path of length k connecting them in G. The graph is called the neighborhood graph of G. We present results on the connectivity and the radius of k-step graphs, especially on the radius of neighborhood graphs. For connected graphs we state bounds on the radius of in terms of the radius of G and we show that the bounds are sharp. For disconnected graphs , we give exact values of the radii of components of . Nutzungsrecht: © 2016 NISC (Pty) Ltd 2016 Neighborhood graph 05C12 radius 05C35 k-step graph Neighborhoods Graphs Vetrík, Tomáš oth Enthalten in Quaestiones mathematicae Grahamstown : NISC, 1976 39(2016), 5, Seite 577-585 (DE-627)130059420 (DE-600)438350-3 (DE-576)015596125 0379-9468 nnns volume:39 year:2016 number:5 pages:577-585 http://dx.doi.org/10.2989/16073606.2015.1113211 Volltext http://www.tandfonline.com/doi/abs/10.2989/16073606.2015.1113211 http://search.proquest.com/docview/1816172575 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_2088 GBV_ILN_4318 31.00 AVZ AR 39 2016 5 577-585
allfieldsGer	10.2989/16073606.2015.1113211 doi PQ20161201 (DE-627)OLC198157381X (DE-599)GBVOLC198157381X (PRQ)c1543-7c179b584a45b874d230639d03a2f5152e63e6178b2177754da5bd3125e677a30 (KEY)0036642020160000039000500577ontheradiusofneighborhoodgraphs DE-627 ger DE-627 rakwb eng 510 DNB 31.00 bkl Mukwembi, Simon verfasserin aut On the radius of neighborhood graphs 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The k-step graph of a graph G has the same vertex set as G and two vertices are adjacent in if and only if there exists a path of length k connecting them in G. The graph is called the neighborhood graph of G. We present results on the connectivity and the radius of k-step graphs, especially on the radius of neighborhood graphs. For connected graphs we state bounds on the radius of in terms of the radius of G and we show that the bounds are sharp. For disconnected graphs , we give exact values of the radii of components of . Nutzungsrecht: © 2016 NISC (Pty) Ltd 2016 Neighborhood graph 05C12 radius 05C35 k-step graph Neighborhoods Graphs Vetrík, Tomáš oth Enthalten in Quaestiones mathematicae Grahamstown : NISC, 1976 39(2016), 5, Seite 577-585 (DE-627)130059420 (DE-600)438350-3 (DE-576)015596125 0379-9468 nnns volume:39 year:2016 number:5 pages:577-585 http://dx.doi.org/10.2989/16073606.2015.1113211 Volltext http://www.tandfonline.com/doi/abs/10.2989/16073606.2015.1113211 http://search.proquest.com/docview/1816172575 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_2088 GBV_ILN_4318 31.00 AVZ AR 39 2016 5 577-585
allfieldsSound	10.2989/16073606.2015.1113211 doi PQ20161201 (DE-627)OLC198157381X (DE-599)GBVOLC198157381X (PRQ)c1543-7c179b584a45b874d230639d03a2f5152e63e6178b2177754da5bd3125e677a30 (KEY)0036642020160000039000500577ontheradiusofneighborhoodgraphs DE-627 ger DE-627 rakwb eng 510 DNB 31.00 bkl Mukwembi, Simon verfasserin aut On the radius of neighborhood graphs 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The k-step graph of a graph G has the same vertex set as G and two vertices are adjacent in if and only if there exists a path of length k connecting them in G. The graph is called the neighborhood graph of G. We present results on the connectivity and the radius of k-step graphs, especially on the radius of neighborhood graphs. For connected graphs we state bounds on the radius of in terms of the radius of G and we show that the bounds are sharp. For disconnected graphs , we give exact values of the radii of components of . Nutzungsrecht: © 2016 NISC (Pty) Ltd 2016 Neighborhood graph 05C12 radius 05C35 k-step graph Neighborhoods Graphs Vetrík, Tomáš oth Enthalten in Quaestiones mathematicae Grahamstown : NISC, 1976 39(2016), 5, Seite 577-585 (DE-627)130059420 (DE-600)438350-3 (DE-576)015596125 0379-9468 nnns volume:39 year:2016 number:5 pages:577-585 http://dx.doi.org/10.2989/16073606.2015.1113211 Volltext http://www.tandfonline.com/doi/abs/10.2989/16073606.2015.1113211 http://search.proquest.com/docview/1816172575 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_2088 GBV_ILN_4318 31.00 AVZ AR 39 2016 5 577-585
language	English
source	Enthalten in Quaestiones mathematicae 39(2016), 5, Seite 577-585 volume:39 year:2016 number:5 pages:577-585
sourceStr	Enthalten in Quaestiones mathematicae 39(2016), 5, Seite 577-585 volume:39 year:2016 number:5 pages:577-585
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Neighborhood graph 05C12 radius 05C35 k-step graph Neighborhoods Graphs
dewey-raw	510
isfreeaccess_bool	false
container_title	Quaestiones mathematicae
authorswithroles_txt_mv	Mukwembi, Simon @@aut@@ Vetrík, Tomáš @@oth@@
publishDateDaySort_date	2016-01-01T00:00:00Z
hierarchy_top_id	130059420
dewey-sort	3510
id	OLC198157381X
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">OLC198157381X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220215183127.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">161013s2016 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.2989/16073606.2015.1113211</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20161201</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC198157381X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC198157381X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c1543-7c179b584a45b874d230639d03a2f5152e63e6178b2177754da5bd3125e677a30</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0036642020160000039000500577ontheradiusofneighborhoodgraphs</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">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mukwembi, Simon</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the radius of neighborhood graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</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">The k-step graph of a graph G has the same vertex set as G and two vertices are adjacent in if and only if there exists a path of length k connecting them in G. The graph is called the neighborhood graph of G. We present results on the connectivity and the radius of k-step graphs, especially on the radius of neighborhood graphs. For connected graphs we state bounds on the radius of in terms of the radius of G and we show that the bounds are sharp. For disconnected graphs , we give exact values of the radii of components of .</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © 2016 NISC (Pty) Ltd 2016</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Neighborhood graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">05C12</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">radius</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">05C35</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">k-step graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Neighborhoods</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphs</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vetrík, Tomáš</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Quaestiones mathematicae</subfield><subfield code="d">Grahamstown : NISC, 1976</subfield><subfield code="g">39(2016), 5, Seite 577-585</subfield><subfield code="w">(DE-627)130059420</subfield><subfield code="w">(DE-600)438350-3</subfield><subfield code="w">(DE-576)015596125</subfield><subfield code="x">0379-9468</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:39</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:5</subfield><subfield code="g">pages:577-585</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.2989/16073606.2015.1113211</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.tandfonline.com/doi/abs/10.2989/16073606.2015.1113211</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1816172575</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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.00</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">39</subfield><subfield code="j">2016</subfield><subfield code="e">5</subfield><subfield code="h">577-585</subfield></datafield></record></collection>
author	Mukwembi, Simon
spellingShingle	Mukwembi, Simon ddc 510 bkl 31.00 misc Neighborhood graph misc 05C12 misc radius misc 05C35 misc k-step graph misc Neighborhoods misc Graphs On the radius of neighborhood graphs
authorStr	Mukwembi, Simon
ppnlink_with_tag_str_mv	@@773@@(DE-627)130059420
format	Article
dewey-ones	510 - Mathematics
delete_txt_mv	keep
author_role	aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	0379-9468
topic_title	510 DNB 31.00 bkl On the radius of neighborhood graphs Neighborhood graph 05C12 radius 05C35 k-step graph Neighborhoods Graphs
topic	ddc 510 bkl 31.00 misc Neighborhood graph misc 05C12 misc radius misc 05C35 misc k-step graph misc Neighborhoods misc Graphs
topic_unstemmed	ddc 510 bkl 31.00 misc Neighborhood graph misc 05C12 misc radius misc 05C35 misc k-step graph misc Neighborhoods misc Graphs
topic_browse	ddc 510 bkl 31.00 misc Neighborhood graph misc 05C12 misc radius misc 05C35 misc k-step graph misc Neighborhoods misc Graphs
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
author2_variant	t v tv
hierarchy_parent_title	Quaestiones mathematicae
hierarchy_parent_id	130059420
dewey-tens	510 - Mathematics
hierarchy_top_title	Quaestiones mathematicae
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)130059420 (DE-600)438350-3 (DE-576)015596125
title	On the radius of neighborhood graphs
ctrlnum	(DE-627)OLC198157381X (DE-599)GBVOLC198157381X (PRQ)c1543-7c179b584a45b874d230639d03a2f5152e63e6178b2177754da5bd3125e677a30 (KEY)0036642020160000039000500577ontheradiusofneighborhoodgraphs
title_full	On the radius of neighborhood graphs
author_sort	Mukwembi, Simon
journal	Quaestiones mathematicae
journalStr	Quaestiones mathematicae
lang_code	eng
isOA_bool	false
dewey-hundreds	500 - Science
recordtype	marc
publishDateSort	2016
contenttype_str_mv	txt
container_start_page	577
author_browse	Mukwembi, Simon
container_volume	39
class	510 DNB 31.00 bkl
format_se	Aufsätze
author-letter	Mukwembi, Simon
doi_str_mv	10.2989/16073606.2015.1113211
dewey-full	510
title_sort	on the radius of neighborhood graphs
title_auth	On the radius of neighborhood graphs
abstract	The k-step graph of a graph G has the same vertex set as G and two vertices are adjacent in if and only if there exists a path of length k connecting them in G. The graph is called the neighborhood graph of G. We present results on the connectivity and the radius of k-step graphs, especially on the radius of neighborhood graphs. For connected graphs we state bounds on the radius of in terms of the radius of G and we show that the bounds are sharp. For disconnected graphs , we give exact values of the radii of components of .
abstractGer	The k-step graph of a graph G has the same vertex set as G and two vertices are adjacent in if and only if there exists a path of length k connecting them in G. The graph is called the neighborhood graph of G. We present results on the connectivity and the radius of k-step graphs, especially on the radius of neighborhood graphs. For connected graphs we state bounds on the radius of in terms of the radius of G and we show that the bounds are sharp. For disconnected graphs , we give exact values of the radii of components of .
abstract_unstemmed	The k-step graph of a graph G has the same vertex set as G and two vertices are adjacent in if and only if there exists a path of length k connecting them in G. The graph is called the neighborhood graph of G. We present results on the connectivity and the radius of k-step graphs, especially on the radius of neighborhood graphs. For connected graphs we state bounds on the radius of in terms of the radius of G and we show that the bounds are sharp. For disconnected graphs , we give exact values of the radii of components of .
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 GBV_ILN_2088 GBV_ILN_4318
container_issue	5
title_short	On the radius of neighborhood graphs
url	http://dx.doi.org/10.2989/16073606.2015.1113211 http://www.tandfonline.com/doi/abs/10.2989/16073606.2015.1113211 http://search.proquest.com/docview/1816172575
remote_bool	false
author2	Vetrík, Tomáš
author2Str	Vetrík, Tomáš
ppnlink	130059420
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
author2_role	oth
doi_str	10.2989/16073606.2015.1113211
up_date	2024-07-03T13:52:08.655Z
_version_	1803566164116242432
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">OLC198157381X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220215183127.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">161013s2016 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.2989/16073606.2015.1113211</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20161201</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC198157381X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC198157381X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c1543-7c179b584a45b874d230639d03a2f5152e63e6178b2177754da5bd3125e677a30</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0036642020160000039000500577ontheradiusofneighborhoodgraphs</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">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mukwembi, Simon</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the radius of neighborhood graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</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">The k-step graph of a graph G has the same vertex set as G and two vertices are adjacent in if and only if there exists a path of length k connecting them in G. The graph is called the neighborhood graph of G. We present results on the connectivity and the radius of k-step graphs, especially on the radius of neighborhood graphs. For connected graphs we state bounds on the radius of in terms of the radius of G and we show that the bounds are sharp. For disconnected graphs , we give exact values of the radii of components of .</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © 2016 NISC (Pty) Ltd 2016</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Neighborhood graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">05C12</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">radius</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">05C35</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">k-step graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Neighborhoods</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphs</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vetrík, Tomáš</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Quaestiones mathematicae</subfield><subfield code="d">Grahamstown : NISC, 1976</subfield><subfield code="g">39(2016), 5, Seite 577-585</subfield><subfield code="w">(DE-627)130059420</subfield><subfield code="w">(DE-600)438350-3</subfield><subfield code="w">(DE-576)015596125</subfield><subfield code="x">0379-9468</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:39</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:5</subfield><subfield code="g">pages:577-585</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.2989/16073606.2015.1113211</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.tandfonline.com/doi/abs/10.2989/16073606.2015.1113211</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1816172575</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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">31.00</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">39</subfield><subfield code="j">2016</subfield><subfield code="e">5</subfield><subfield code="h">577-585</subfield></datafield></record></collection>
score	7.3996363

Nicht das Richtige dabei?

Schreiben Sie uns!

On the radius of neighborhood graphs

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?