A Collection of Minimally Path Square-Saturated Graphs

Given a simple graph G, m a positive integer. The square of path graph P_m, denoted by P_m^2, is a graph obtained from P_m by adding new edges between any pair of vertices at distance at most 2 in P_m. A graph G is P_m^2-saturated if G does not contain P_m^2 as a subgraph, but the addition of any ed...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Salwa Nursyahida [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch ; Indonesisch

Erschienen:	2020

Schlagwörter:	power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph

Übergeordnetes Werk:	In: Kubik - UIN Sunan Gunung Djati Bandung, Mathematics Department, 2022, 5(2020), 1, Seite 20-27
Übergeordnetes Werk:	volume:5 ; year:2020 ; number:1 ; pages:20-27

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc Journal toc

DOI / URN:	10.15575/kubik.v5i1.8415

Katalog-ID:	DOAJ000731307

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ000731307
003	DE-627
005	20230311012954.0
007	cr uuu---uuuuu
008	230225s2020 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.15575/kubik.v5i1.8415 \|2 doi
035			\|a (DE-627)DOAJ000731307
035			\|a (DE-599)DOAJ85b672f41adf40cc8244618f7e5e3854
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng \|a ind
050		0	\|a QA1-939
100	0		\|a Salwa Nursyahida \|e verfasserin \|4 aut
245	1	2	\|a A Collection of Minimally Path Square-Saturated Graphs
264		1	\|c 2020
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a Given a simple graph G, m a positive integer. The square of path graph P_m, denoted by P_m^2, is a graph obtained from P_m by adding new edges between any pair of vertices at distance at most 2 in P_m. A graph G is P_m^2-saturated if G does not contain P_m^2 as a subgraph, but the addition of any edge between two nonadjacent vertices in G contain P_m^2. The minimum size of P_m^2-saturated graph on n vertices is called a saturation number for P_m^2, denoted by sat(n,P_m^2). A set Sat(n,P_m^2 )={G:\|V(G)\|=sat(n,P_m^2) and G a P_m^2-saturated graph}. All graphs in Sat(n,P_m^2) are obtained computationally for n≤8 and m≤8 and expressed by their degree sequence.
650		4	\|a power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph
653		0	\|a Mathematics
773	0	8	\|i In \|t Kubik \|d UIN Sunan Gunung Djati Bandung, Mathematics Department, 2022 \|g 5(2020), 1, Seite 20-27 \|w (DE-627)DOAJ000153133 \|x 26860341 \|7 nnns
773	1	8	\|g volume:5 \|g year:2020 \|g number:1 \|g pages:20-27
856	4	0	\|u https://doi.org/10.15575/kubik.v5i1.8415 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/85b672f41adf40cc8244618f7e5e3854 \|z kostenfrei
856	4	0	\|u https://journal.uinsgd.ac.id/index.php/kubik/article/view/8415 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2338-0896 \|y Journal toc \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2686-0341 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
951			\|a AR
952			\|d 5 \|j 2020 \|e 1 \|h 20-27

Indexfelder

author_variant	s n sn
matchkey_str	article:26860341:2020----::cletoomnmlyahqae
hierarchy_sort_str	2020
callnumber-subject-code	QA
publishDate	2020
allfields	10.15575/kubik.v5i1.8415 doi (DE-627)DOAJ000731307 (DE-599)DOAJ85b672f41adf40cc8244618f7e5e3854 DE-627 ger DE-627 rakwb eng ind QA1-939 Salwa Nursyahida verfasserin aut A Collection of Minimally Path Square-Saturated Graphs 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Given a simple graph G, m a positive integer. The square of path graph P_m, denoted by P_m^2, is a graph obtained from P_m by adding new edges between any pair of vertices at distance at most 2 in P_m. A graph G is P_m^2-saturated if G does not contain P_m^2 as a subgraph, but the addition of any edge between two nonadjacent vertices in G contain P_m^2. The minimum size of P_m^2-saturated graph on n vertices is called a saturation number for P_m^2, denoted by sat(n,P_m^2). A set Sat(n,P_m^2 )={G:\|V(G)\|=sat(n,P_m^2) and G a P_m^2-saturated graph}. All graphs in Sat(n,P_m^2) are obtained computationally for n≤8 and m≤8 and expressed by their degree sequence. power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph Mathematics In Kubik UIN Sunan Gunung Djati Bandung, Mathematics Department, 2022 5(2020), 1, Seite 20-27 (DE-627)DOAJ000153133 26860341 nnns volume:5 year:2020 number:1 pages:20-27 https://doi.org/10.15575/kubik.v5i1.8415 kostenfrei https://doaj.org/article/85b672f41adf40cc8244618f7e5e3854 kostenfrei https://journal.uinsgd.ac.id/index.php/kubik/article/view/8415 kostenfrei https://doaj.org/toc/2338-0896 Journal toc kostenfrei https://doaj.org/toc/2686-0341 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ AR 5 2020 1 20-27
spelling	10.15575/kubik.v5i1.8415 doi (DE-627)DOAJ000731307 (DE-599)DOAJ85b672f41adf40cc8244618f7e5e3854 DE-627 ger DE-627 rakwb eng ind QA1-939 Salwa Nursyahida verfasserin aut A Collection of Minimally Path Square-Saturated Graphs 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Given a simple graph G, m a positive integer. The square of path graph P_m, denoted by P_m^2, is a graph obtained from P_m by adding new edges between any pair of vertices at distance at most 2 in P_m. A graph G is P_m^2-saturated if G does not contain P_m^2 as a subgraph, but the addition of any edge between two nonadjacent vertices in G contain P_m^2. The minimum size of P_m^2-saturated graph on n vertices is called a saturation number for P_m^2, denoted by sat(n,P_m^2). A set Sat(n,P_m^2 )={G:\|V(G)\|=sat(n,P_m^2) and G a P_m^2-saturated graph}. All graphs in Sat(n,P_m^2) are obtained computationally for n≤8 and m≤8 and expressed by their degree sequence. power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph Mathematics In Kubik UIN Sunan Gunung Djati Bandung, Mathematics Department, 2022 5(2020), 1, Seite 20-27 (DE-627)DOAJ000153133 26860341 nnns volume:5 year:2020 number:1 pages:20-27 https://doi.org/10.15575/kubik.v5i1.8415 kostenfrei https://doaj.org/article/85b672f41adf40cc8244618f7e5e3854 kostenfrei https://journal.uinsgd.ac.id/index.php/kubik/article/view/8415 kostenfrei https://doaj.org/toc/2338-0896 Journal toc kostenfrei https://doaj.org/toc/2686-0341 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ AR 5 2020 1 20-27
allfields_unstemmed	10.15575/kubik.v5i1.8415 doi (DE-627)DOAJ000731307 (DE-599)DOAJ85b672f41adf40cc8244618f7e5e3854 DE-627 ger DE-627 rakwb eng ind QA1-939 Salwa Nursyahida verfasserin aut A Collection of Minimally Path Square-Saturated Graphs 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Given a simple graph G, m a positive integer. The square of path graph P_m, denoted by P_m^2, is a graph obtained from P_m by adding new edges between any pair of vertices at distance at most 2 in P_m. A graph G is P_m^2-saturated if G does not contain P_m^2 as a subgraph, but the addition of any edge between two nonadjacent vertices in G contain P_m^2. The minimum size of P_m^2-saturated graph on n vertices is called a saturation number for P_m^2, denoted by sat(n,P_m^2). A set Sat(n,P_m^2 )={G:\|V(G)\|=sat(n,P_m^2) and G a P_m^2-saturated graph}. All graphs in Sat(n,P_m^2) are obtained computationally for n≤8 and m≤8 and expressed by their degree sequence. power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph Mathematics In Kubik UIN Sunan Gunung Djati Bandung, Mathematics Department, 2022 5(2020), 1, Seite 20-27 (DE-627)DOAJ000153133 26860341 nnns volume:5 year:2020 number:1 pages:20-27 https://doi.org/10.15575/kubik.v5i1.8415 kostenfrei https://doaj.org/article/85b672f41adf40cc8244618f7e5e3854 kostenfrei https://journal.uinsgd.ac.id/index.php/kubik/article/view/8415 kostenfrei https://doaj.org/toc/2338-0896 Journal toc kostenfrei https://doaj.org/toc/2686-0341 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ AR 5 2020 1 20-27
allfieldsGer	10.15575/kubik.v5i1.8415 doi (DE-627)DOAJ000731307 (DE-599)DOAJ85b672f41adf40cc8244618f7e5e3854 DE-627 ger DE-627 rakwb eng ind QA1-939 Salwa Nursyahida verfasserin aut A Collection of Minimally Path Square-Saturated Graphs 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Given a simple graph G, m a positive integer. The square of path graph P_m, denoted by P_m^2, is a graph obtained from P_m by adding new edges between any pair of vertices at distance at most 2 in P_m. A graph G is P_m^2-saturated if G does not contain P_m^2 as a subgraph, but the addition of any edge between two nonadjacent vertices in G contain P_m^2. The minimum size of P_m^2-saturated graph on n vertices is called a saturation number for P_m^2, denoted by sat(n,P_m^2). A set Sat(n,P_m^2 )={G:\|V(G)\|=sat(n,P_m^2) and G a P_m^2-saturated graph}. All graphs in Sat(n,P_m^2) are obtained computationally for n≤8 and m≤8 and expressed by their degree sequence. power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph Mathematics In Kubik UIN Sunan Gunung Djati Bandung, Mathematics Department, 2022 5(2020), 1, Seite 20-27 (DE-627)DOAJ000153133 26860341 nnns volume:5 year:2020 number:1 pages:20-27 https://doi.org/10.15575/kubik.v5i1.8415 kostenfrei https://doaj.org/article/85b672f41adf40cc8244618f7e5e3854 kostenfrei https://journal.uinsgd.ac.id/index.php/kubik/article/view/8415 kostenfrei https://doaj.org/toc/2338-0896 Journal toc kostenfrei https://doaj.org/toc/2686-0341 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ AR 5 2020 1 20-27
allfieldsSound	10.15575/kubik.v5i1.8415 doi (DE-627)DOAJ000731307 (DE-599)DOAJ85b672f41adf40cc8244618f7e5e3854 DE-627 ger DE-627 rakwb eng ind QA1-939 Salwa Nursyahida verfasserin aut A Collection of Minimally Path Square-Saturated Graphs 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Given a simple graph G, m a positive integer. The square of path graph P_m, denoted by P_m^2, is a graph obtained from P_m by adding new edges between any pair of vertices at distance at most 2 in P_m. A graph G is P_m^2-saturated if G does not contain P_m^2 as a subgraph, but the addition of any edge between two nonadjacent vertices in G contain P_m^2. The minimum size of P_m^2-saturated graph on n vertices is called a saturation number for P_m^2, denoted by sat(n,P_m^2). A set Sat(n,P_m^2 )={G:\|V(G)\|=sat(n,P_m^2) and G a P_m^2-saturated graph}. All graphs in Sat(n,P_m^2) are obtained computationally for n≤8 and m≤8 and expressed by their degree sequence. power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph Mathematics In Kubik UIN Sunan Gunung Djati Bandung, Mathematics Department, 2022 5(2020), 1, Seite 20-27 (DE-627)DOAJ000153133 26860341 nnns volume:5 year:2020 number:1 pages:20-27 https://doi.org/10.15575/kubik.v5i1.8415 kostenfrei https://doaj.org/article/85b672f41adf40cc8244618f7e5e3854 kostenfrei https://journal.uinsgd.ac.id/index.php/kubik/article/view/8415 kostenfrei https://doaj.org/toc/2338-0896 Journal toc kostenfrei https://doaj.org/toc/2686-0341 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ AR 5 2020 1 20-27
language	English Indonesian
source	In Kubik 5(2020), 1, Seite 20-27 volume:5 year:2020 number:1 pages:20-27
sourceStr	In Kubik 5(2020), 1, Seite 20-27 volume:5 year:2020 number:1 pages:20-27
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph Mathematics
isfreeaccess_bool	true
container_title	Kubik
authorswithroles_txt_mv	Salwa Nursyahida @@aut@@
publishDateDaySort_date	2020-01-01T00:00:00Z
hierarchy_top_id	DOAJ000153133
id	DOAJ000731307
language_de	englisch Sangiang
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ000731307</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230311012954.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2020 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.15575/kubik.v5i1.8415</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ000731307</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ85b672f41adf40cc8244618f7e5e3854</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><subfield code="a">ind</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA1-939</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Salwa Nursyahida</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Collection of Minimally Path Square-Saturated Graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Given a simple graph G, m a positive integer. The square of path graph P_m, denoted by P_m^2, is a graph obtained from P_m by adding new edges between any pair of vertices at distance at most 2 in P_m. A graph G is P_m^2-saturated if G does not contain P_m^2 as a subgraph, but the addition of any edge between two nonadjacent vertices in G contain P_m^2. The minimum size of P_m^2-saturated graph on n vertices is called a saturation number for P_m^2, denoted by sat(n,P_m^2). A set Sat(n,P_m^2 )={G:\|V(G)\|=sat(n,P_m^2) and G a P_m^2-saturated graph}. All graphs in Sat(n,P_m^2) are obtained computationally for n≤8 and m≤8 and expressed by their degree sequence.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Kubik</subfield><subfield code="d">UIN Sunan Gunung Djati Bandung, Mathematics Department, 2022</subfield><subfield code="g">5(2020), 1, Seite 20-27</subfield><subfield code="w">(DE-627)DOAJ000153133</subfield><subfield code="x">26860341</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:5</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:20-27</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.15575/kubik.v5i1.8415</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/85b672f41adf40cc8244618f7e5e3854</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://journal.uinsgd.ac.id/index.php/kubik/article/view/8415</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2338-0896</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2686-0341</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</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_DOAJ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">5</subfield><subfield code="j">2020</subfield><subfield code="e">1</subfield><subfield code="h">20-27</subfield></datafield></record></collection>
callnumber-first	Q - Science
author	Salwa Nursyahida
spellingShingle	Salwa Nursyahida misc QA1-939 misc power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph misc Mathematics A Collection of Minimally Path Square-Saturated Graphs
authorStr	Salwa Nursyahida
ppnlink_with_tag_str_mv	@@773@@(DE-627)DOAJ000153133
format	electronic Article
delete_txt_mv	keep
author_role	aut
collection	DOAJ
remote_str	true
callnumber-label	QA1-939
illustrated	Not Illustrated
issn	26860341
topic_title	QA1-939 A Collection of Minimally Path Square-Saturated Graphs power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph
topic	misc QA1-939 misc power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph misc Mathematics
topic_unstemmed	misc QA1-939 misc power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph misc Mathematics
topic_browse	misc QA1-939 misc power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph misc Mathematics
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Kubik
hierarchy_parent_id	DOAJ000153133
hierarchy_top_title	Kubik
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)DOAJ000153133
title	A Collection of Minimally Path Square-Saturated Graphs
ctrlnum	(DE-627)DOAJ000731307 (DE-599)DOAJ85b672f41adf40cc8244618f7e5e3854
title_full	A Collection of Minimally Path Square-Saturated Graphs
author_sort	Salwa Nursyahida
journal	Kubik
journalStr	Kubik
callnumber-first-code	Q
lang_code	eng ind
isOA_bool	true
recordtype	marc
publishDateSort	2020
contenttype_str_mv	txt
container_start_page	20
author_browse	Salwa Nursyahida
container_volume	5
class	QA1-939
format_se	Elektronische Aufsätze
author-letter	Salwa Nursyahida
doi_str_mv	10.15575/kubik.v5i1.8415
title_sort	collection of minimally path square-saturated graphs
callnumber	QA1-939
title_auth	A Collection of Minimally Path Square-Saturated Graphs
abstract	Given a simple graph G, m a positive integer. The square of path graph P_m, denoted by P_m^2, is a graph obtained from P_m by adding new edges between any pair of vertices at distance at most 2 in P_m. A graph G is P_m^2-saturated if G does not contain P_m^2 as a subgraph, but the addition of any edge between two nonadjacent vertices in G contain P_m^2. The minimum size of P_m^2-saturated graph on n vertices is called a saturation number for P_m^2, denoted by sat(n,P_m^2). A set Sat(n,P_m^2 )={G:\|V(G)\|=sat(n,P_m^2) and G a P_m^2-saturated graph}. All graphs in Sat(n,P_m^2) are obtained computationally for n≤8 and m≤8 and expressed by their degree sequence.
abstractGer	Given a simple graph G, m a positive integer. The square of path graph P_m, denoted by P_m^2, is a graph obtained from P_m by adding new edges between any pair of vertices at distance at most 2 in P_m. A graph G is P_m^2-saturated if G does not contain P_m^2 as a subgraph, but the addition of any edge between two nonadjacent vertices in G contain P_m^2. The minimum size of P_m^2-saturated graph on n vertices is called a saturation number for P_m^2, denoted by sat(n,P_m^2). A set Sat(n,P_m^2 )={G:\|V(G)\|=sat(n,P_m^2) and G a P_m^2-saturated graph}. All graphs in Sat(n,P_m^2) are obtained computationally for n≤8 and m≤8 and expressed by their degree sequence.
abstract_unstemmed	Given a simple graph G, m a positive integer. The square of path graph P_m, denoted by P_m^2, is a graph obtained from P_m by adding new edges between any pair of vertices at distance at most 2 in P_m. A graph G is P_m^2-saturated if G does not contain P_m^2 as a subgraph, but the addition of any edge between two nonadjacent vertices in G contain P_m^2. The minimum size of P_m^2-saturated graph on n vertices is called a saturation number for P_m^2, denoted by sat(n,P_m^2). A set Sat(n,P_m^2 )={G:\|V(G)\|=sat(n,P_m^2) and G a P_m^2-saturated graph}. All graphs in Sat(n,P_m^2) are obtained computationally for n≤8 and m≤8 and expressed by their degree sequence.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ
container_issue	1
title_short	A Collection of Minimally Path Square-Saturated Graphs
url	https://doi.org/10.15575/kubik.v5i1.8415 https://doaj.org/article/85b672f41adf40cc8244618f7e5e3854 https://journal.uinsgd.ac.id/index.php/kubik/article/view/8415 https://doaj.org/toc/2338-0896 https://doaj.org/toc/2686-0341
remote_bool	true
ppnlink	DOAJ000153133
callnumber-subject	QA - Mathematics
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.15575/kubik.v5i1.8415
callnumber-a	QA1-939
up_date	2024-07-03T16:13:25.482Z
_version_	1803575052712542208
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ000731307</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230311012954.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230225s2020 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.15575/kubik.v5i1.8415</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ000731307</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ85b672f41adf40cc8244618f7e5e3854</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><subfield code="a">ind</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA1-939</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Salwa Nursyahida</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Collection of Minimally Path Square-Saturated Graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Given a simple graph G, m a positive integer. The square of path graph P_m, denoted by P_m^2, is a graph obtained from P_m by adding new edges between any pair of vertices at distance at most 2 in P_m. A graph G is P_m^2-saturated if G does not contain P_m^2 as a subgraph, but the addition of any edge between two nonadjacent vertices in G contain P_m^2. The minimum size of P_m^2-saturated graph on n vertices is called a saturation number for P_m^2, denoted by sat(n,P_m^2). A set Sat(n,P_m^2 )={G:\|V(G)\|=sat(n,P_m^2) and G a P_m^2-saturated graph}. All graphs in Sat(n,P_m^2) are obtained computationally for n≤8 and m≤8 and expressed by their degree sequence.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">power graphs, path square, saturated numbers, saturated graphs, degree sequence of graph</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Kubik</subfield><subfield code="d">UIN Sunan Gunung Djati Bandung, Mathematics Department, 2022</subfield><subfield code="g">5(2020), 1, Seite 20-27</subfield><subfield code="w">(DE-627)DOAJ000153133</subfield><subfield code="x">26860341</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:5</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:20-27</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.15575/kubik.v5i1.8415</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/85b672f41adf40cc8244618f7e5e3854</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://journal.uinsgd.ac.id/index.php/kubik/article/view/8415</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2338-0896</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2686-0341</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</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_DOAJ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">5</subfield><subfield code="j">2020</subfield><subfield code="e">1</subfield><subfield code="h">20-27</subfield></datafield></record></collection>
score	7.4000654

Nicht das Richtige dabei?

Schreiben Sie uns!

A Collection of Minimally Path Square-Saturated Graphs

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?