المؤلفون: P Sumathi, G Geetha Ramani

المصدر: Indian Journal of Science and Technology, 16(44), 4038-4047, (2023-11-26)

مصطلحات موضوعية: Star graph, W­star, Square of graph G, Splitting graph, Banana tree, Graceful labeling

Relation: eissn:0974-5645; https://doi.org/10.17485/IJST/v16i44.2058; oai:zenodo.org:13710133

الاتاحة: https://doi.org/10.17485/IJST/v16i44.2058
https://indjst.org/articles/arithmetic-sequential-graceful-labeling-of-star-related-graphs-ii

المؤلفون: Iuliana Carmen Bărbăcioru, Viorica Mariela Ungureanu

المصدر: Analele Universităţii "Constantin Brâncuşi" din Târgu Jiu: Seria Inginerie, Vol 2019, Iss 4, Pp 30-33 (2019)

مصطلحات موضوعية: fuzzy graphs, complete fuzzy graphs, weight of a strong domination set d, strong domination number of a fuzzy graph g, a minimum strong domination set in a fuzzy graph g, Engineering (General). Civil engineering (General), TA1-2040

وصف الملف: electronic resource

Relation: http://www.utgjiu.ro/rev_ing/pdf/2019-4/04_Carmen_Barbacioru__STRENGTH%20DOMINATION%20IN%20FUZZY%20GRAPH.pdf; https://doaj.org/toc/1842-4856; https://doaj.org/toc/2537-530X

URL الوصول: https://doaj.org/article/faaec84a698c43dd9de0bf9b413847fb

المؤلفون: Díaz, J., Diner, Ö.Y., Serna, M., Serra, O.

مصطلحات موضوعية: Convex bipartite graphs, Generalized combinatorial problems, Multicolored realization problem, Parameterized complexity, Complex networks, Graph theory, Graphic methods, Parameterization, Bipartite graphs, Combinatorial problem, Convex bipartite graph, Convex-bipartite, Generalized combinatorial problem, Graph G, Parameterized, Realization problems, Color

وصف الملف: application/pdf

Relation: Discrete Applied Mathematics; Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı; https://doi.org/10.1016/j.dam.2022.06.031; https://hdl.handle.net/20.500.12469/4902; 2-s2.0-85133340021

الاتاحة: https://hdl.handle.net/20.500.12469/4902
https://doi.org/10.1016/j.dam.2022.06.031

المؤلفون: Mahde, Sultan Senan, Mathad, Veena

مصطلحات موضوعية: Integrity, Hub set, Hub-integrity, HI-set of a graph G, HIs-polynomials, Stirling numbers, Log-convexity, Bell polynomials

وصف الملف: application/pdf

Relation: TWMS Journal Of Applied And Engineering Mathematics; Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı; Mahde, S. S. & Mathad, V. (2020). Hub-integrity polynomial of graphs. TWMS Journal Of Applied And Engineering Mathematics, 10(2), 434-442.Mathad, Veena; https://hdl.handle.net/11729/2831; http://jaem.isikun.edu.tr/web/index.php/archive/105-vol10no2/534; 10; 434; 442

الاتاحة: https://hdl.handle.net/11729/2831
http://jaem.isikun.edu.tr/web/index.php/archive/105-vol10no2/534

المؤلفون: Manjula. C. Gudgeri, Varsha

المساهمون: Blue Eyes Intelligence Engineering and Sciences Publication(BEIESP)

المصدر: International Journal of Recent Technology and Engineering (IJRTE), 9(2), 161-164, (2020-07-30)

مصطلحات موضوعية: dominating set, domination number, double dominating set, double domination number. We denote n, ∆ respectively by number of vertices, maximum degree of a graph G

Relation: https://doi.org/10.35940/ijrte.B3307.079220; oai:zenodo.org:5852441

الاتاحة: https://doi.org/10.35940/ijrte.B3307.079220

المؤلفون: Aytaç, A., Kartal, Yıldız, Z.

مصطلحات موضوعية: graph operations, Domination number, Graph G, Lexicographic product, Modular products, Semitotal domination, Graph theory, domination, Cardinalities, Dominating sets

Relation: Numerical Methods for Partial Differential Equations; Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı; https://doi.org/10.1002/num.22746; https://hdl.handle.net/11454/90051; 39; 1841; 1850

الاتاحة: https://hdl.handle.net/11454/90051
https://doi.org/10.1002/num.22746

المؤلفون: Casselgren, Carl Johan, 1982, Granholm, Jonas, 1991, Raspaud, A.

المصدر: Journal of Combinatorial Mathematics and Combinatorial Computing. 116:101-109

مصطلحات موضوعية: Coloring, Graphic methods, Choosability, Choosable, Edge coloring, Graph G, List assignment, Planar graph, Vertex coloring, Graph theory, Adaptable choosability, Choosability with separation, List coloring

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-188195

المؤلفون: Dr. V. Ganesan, S. Vijayaraj, M. Velmurugan

المصدر: International Journal of Applied and Advanced Scientific Research, 3(2), 28-30, (2018-09-22)

مصطلحات موضوعية: Graph Labeling, Prime Labeling, Path Graph & Split Graph of a Graph G

Relation: https://doi.org/10.5281/zenodo.1432754; https://doi.org/10.5281/zenodo.1432755; oai:zenodo.org:1432755

الاتاحة: https://doi.org/10.5281/zenodo.1432755

المؤلفون: kumari, P.Raja, Bibi, K. Ameenal

المصدر: International Journal of Advanced Research in Computer Science; Vol 8, No 6 (2017): July 2017 special issue III; 74-77 ; 0976-5697 ; 10.26483/ijarcs.v8i6

مصطلحات موضوعية: Dominating set, Domination number, Strong dominating set, Weak dominating set, Strong domination number, Weak domination number, Middle graph of a graph G

وصف الملف: application/pdf

Relation: http://www.ijarcs.info/index.php/Ijarcs/article/view/4329/3834; http://www.ijarcs.info/index.php/Ijarcs/article/view/4329

الاتاحة: http://www.ijarcs.info/index.php/Ijarcs/article/view/4329
https://doi.org/10.26483/ijarcs.v8i6.4329

المؤلفون: Şahin B., Şahin A.

المساهمون: Belirlenecek

مصطلحات موضوعية: Domination, Double edge-vertex domination, Edge-vertex domination, Cardinalities, Dominating sets, Domination number, Graph G, Graph theory

Relation: Advances in Intelligent Systems and Computing; Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı; https://doi.org/10.1007/978-3-030-51156-2_182; https://hdl.handle.net/20.500.12501/2486; 1197 AISC; 1564; 1572; 2-s2.0-85088752296

الاتاحة: https://hdl.handle.net/20.500.12501/2486
https://doi.org/10.1007/978-3-030-51156-2_182

المؤلفون: Ayhan Khalil, Ghassan T. Marougi

المصدر: مجلة التربية والعلم, Vol 19, Iss 2, Pp 64-75 (2007)

مصطلحات موضوعية: kronecker product, k-fold basis, graph g, Education, Science (General), Q1-390

وصف الملف: electronic resource

Relation: https://edusj.mosuljournals.com/article_5777_43fcca1399ca0a2c25a1c14745f685f3.pdf; https://doaj.org/toc/1812-125X; https://doaj.org/toc/2664-2530

URL الوصول: https://doaj.org/article/f4777d1ae27c44e49f322df36eb1ce63

المؤلفون: Velasquez, C.I.B., Bonomo, F., Koch, I.

المصدر: Discrete Appl Math 2011;159(1):60-68

مصطلحات موضوعية: b-coloring, b-continuity, b-monotonicity, P4-tidy graphs, B-chromatic number, Chromatic number, Graph G, Induced subgraphs, Monotonicity, Polynomial-time algorithms, Color, Coloring, Graphic methods, Polynomial approximation, Graph theory

وصف الملف: application/pdf

Relation: http://hdl.handle.net/20.500.12110/paper_0166218X_v159_n1_p60_Velasquez; http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0166218X_v159_n1_p60_Velasquez_oai

الاتاحة: https://hdl.handle.net/20.500.12110/paper_0166218X_v159_n1_p60_Velasquez
http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0166218X_v159_n1_p60_Velasquez_oai

المؤلفون: Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L.

المصدر: Discrete Appl Math 2010;158(12):1259-1267

مصطلحات موضوعية: Algorithms, Clique graphs, Helly circular-arc graphs, K-behavior, Proper Helly circular-arc graphs, Circular-arc graph, Complete solutions, Graph G, Intersection graph, Linear time, Recognition algorithm, Graph theory, Mathematical operators, Graphic methods

وصف الملف: application/pdf

Relation: http://hdl.handle.net/20.500.12110/paper_0166218X_v158_n12_p1259_Lin; http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0166218X_v158_n12_p1259_Lin_oai

الاتاحة: https://hdl.handle.net/20.500.12110/paper_0166218X_v158_n12_p1259_Lin
http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0166218X_v158_n12_p1259_Lin_oai

المؤلفون: MAHDE, S. S., MATHAD, V.

المصدر: Volume: 10, Issue: 2 434-442 ; 2587-1013 ; TWMS Journal of Applied and Engineering Mathematics

مصطلحات موضوعية: Integrity,Hub set,Hub-integrity,HI-set of a graph G,HIs-polynomials

وصف الملف: application/pdf

Relation: https://dergipark.org.tr/tr/download/article-file/1181260; https://dergipark.org.tr/tr/pub/twmsjaem/issue/55713/761742

الاتاحة: https://dergipark.org.tr/tr/pub/twmsjaem/issue/55713/761742

المؤلفون: Allen Hatcher, Nathalie Wahl

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://arxiv.org/pdf/math/0406277v1.pdf.

مصطلحات موضوعية: Figure 1. The graph G n

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.235.9032; http://arxiv.org/pdf/math/0406277v1.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.235.9032
http://arxiv.org/pdf/math/0406277v1.pdf

المؤلفون: Noga Alon, Michael Capalbo, Yoshiharu Kohayakawa, Vojtěch Rödl, Andrzej Ruciński, Endre Szemerédi

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.staff.amu.edu.pl/~rucinski/papers/61.pdf.

مصطلحات موضوعية: graph G contains a subgraph isomorphic to H. Thus

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.3621; http://www.staff.amu.edu.pl/~rucinski/papers/61.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.3621
http://www.staff.amu.edu.pl/~rucinski/papers/61.pdf

المؤلفون: Paul-André Melliès

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.dcs.ed.ac.uk/home/paulm/factorisation.ps.gz.

مصطلحات موضوعية: category C is the free category on this graph G, 1. its objects are the vertices of G

وصف الملف: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.6946; http://www.dcs.ed.ac.uk/home/paulm/factorisation.ps.gz

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.6946
http://www.dcs.ed.ac.uk/home/paulm/factorisation.ps.gz

المؤلفون: Hua Xue, P. Huijbregts, Jochen A. G. Jess

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.cecs.uci.edu/~papers/compendium94-03/papers/1994/dac94/pdffiles/24_6.pdf.

مصطلحات موضوعية: Problem, Minimum Steiner Tree Instance, A connected undirected graph G(V, also called routing

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.381.3433; http://www.cecs.uci.edu/~papers/compendium94-03/papers/1994/dac94/pdffiles/24_6.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.381.3433
http://www.cecs.uci.edu/~papers/compendium94-03/papers/1994/dac94/pdffiles/24_6.pdf

المؤلفون: N. S. Narayanaswamy, R. Krithika

المصدر: Information Processing Letters. 113:849-851

مصطلحات موضوعية: Discrete mathematics, Compression algorithms, Vertex cover, Parameterized complexity, Disjoint sets, Graph G, Graph, Computer Science Applications, Theoretical Computer Science, Graph theory, Combinatorics, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, Signal Processing, Graph algorithms, Algorithms, Odd cycle transversals, ComputingMethodologies_COMPUTERGRAPHICS, MathematicsofComputing_DISCRETEMATHEMATICS, Information Systems, Mathematics, Data compression

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16bac6d4bc0d450ce18eae14f221fbde
https://doi.org/10.1016/j.ipl.2013.08.007

المؤلفون: Safina Devi, N., Mane, A.C., Mishra, S.

المصدر: IndraStra Global.

مصطلحات موضوعية: Local ratio, Vertex Cover problems, 4-free graph, K1, Graph G, Approximation algorithms, Regular graphs, Graph theory, Vertex cover, Graphic methods, APX-complete, Free graphs, Algorithms, Bipartite graphs

URL الوصول: https://explore.openaire.eu/search/publication?articleId=issn23813652::ec55e93666b2303b427eb7c61633b900
https://igi.indrastra.com/items/show/82922