{ "labelLang" : "hun", "responseDate" : "2024-03-28 23:54", "content" : { "otype" : "JournalArticle", "mtid" : 30384508, "status" : "VALIDATED", "published" : true, "comment" : "Department of Mathematics, Shanghai University, Shanghai, 200444, China \n School of Statistics and Information, Shanghai University of International Business and Economics, Shanghai, 201620, China \n School of Management, Shanghai University, Shanghai, 200444, China \n Cited By :1 \n Export Date: 10 January 2019 \n CODEN: DAMAD \n Correspondence Address: Shan, E.; School of Management, Shanghai UniversityChina; email: efshan@shu.edu.cn\nDepartment of Mathematics, Shanghai University, Shanghai, 200444, China \n School of Statistics and Information, Shanghai University of International Business and Economics, Shanghai, 201620, China \n School of Management, Shanghai University, Shanghai, 200444, China \n Cited By :3 \n Export Date: 3 October 2019 \n CODEN: DAMAD \n Correspondence Address: Shan, E.; School of Management, Shanghai UniversityChina; email: efshan@shu.edu.cn\nDepartment of Mathematics, Shanghai University, Shanghai, 200444, China \n School of Statistics and Information, Shanghai University of International Business and Economics, Shanghai, 201620, China \n School of Management, Shanghai University, Shanghai, 200444, China \n Cited By :5 \n Export Date: 20 January 2020 \n CODEN: DAMAD \n Correspondence Address: Shan, E.; School of Management, Shanghai UniversityChina; email: efshan@shu.edu.cn", "unhandledTickets" : 0, "deleted" : false, "lastRefresh" : "2023-03-23T21:26:48.289+0000", "lastModified" : "2019-02-23T15:29:01.013+0000", "created" : "2019-01-10T04:44:12.359+0000", "creator" : { "otype" : "Admin", "mtid" : 10015168, "link" : "/api/admin/10015168", "label" : "Szakonyi Erzsebet (RAMKI admin 4)", "familyName" : "Szakonyi", "givenName" : "Erzsebet", "published" : true, "oldId" : 10015168, "snippet" : true }, "lastDuplumSearch" : "2024-03-14T19:09:44.345+0000", "validated" : "2019-02-23T17:01:21.129+0000", "validator" : { "otype" : "Admin", "mtid" : 521, "link" : "/api/admin/521", "label" : "Szuper Admin (admin)", "familyName" : "Szuper", "givenName" : "Admin", "published" : true, "snippet" : true }, "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000059, "link" : "/api/subtype/10000059", "label" : "Szakcikk (Folyóiratcikk)", "name" : "Szakcikk", "nameEng" : "Article", "docType" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "listPosition" : 101, "published" : true, "oldId" : 10000059, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "firstAuthor" : "Dong, Y.", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 84975911, "link" : "/api/authorship/84975911", "label" : "Dong, Y.", "listPosition" : 1, "share" : 0.0, "first" : true, "last" : false, "familyName" : "Dong", "givenName" : "Y.", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 84975912, "link" : "/api/authorship/84975912", "label" : "Shan, E.", "listPosition" : 2, "share" : 0.0, "first" : false, "last" : false, "familyName" : "Shan", "givenName" : "E.", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 84975913, "link" : "/api/authorship/84975913", "label" : "Kang, L.", "listPosition" : 3, "share" : 0.0, "first" : false, "last" : false, "familyName" : "Kang", "givenName" : "L.", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 84975914, "link" : "/api/authorship/84975914", "label" : "Li, S.", "listPosition" : 4, "share" : 0.0, "first" : false, "last" : true, "familyName" : "Li", "givenName" : "S.", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "snippet" : true } ], "title" : "Domination in intersecting hypergraphs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 15115926, "link" : "/api/publicationidentifier/15115926", "label" : "DOI: 10.1016/j.dam.2018.05.039", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "10.1016/j.dam.2018.05.039", "realUrl" : "https://doi.org/10.1016/j.dam.2018.05.039", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15225672, "link" : "/api/publicationidentifier/15225672", "label" : "WoS: 000454382800015", "source" : { "otype" : "PlainSource", "mtid" : 1, "link" : "/api/publicationsource/1", "label" : "WoS", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "WoS", "nameEng" : "WoS", "linkPattern" : "https://www.webofscience.com/wos/woscc/full-record/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 1, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "000454382800015", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000454382800015", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 15115925, "link" : "/api/publicationidentifier/15115925", "label" : "Scopus: 85048725393", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "85048725393", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85048725393", "published" : false, "snippet" : true } ], "journal" : { "otype" : "Journal", "mtid" : 1326, "link" : "/api/journal/1326", "label" : "DISCRETE APPLIED MATHEMATICS 0166-218X 1872-6771", "pIssn" : "0166-218X", "eIssn" : "1872-6771", "reviewType" : "REVIEWED", "noIF" : false, "sciIndexed" : true, "scopusIndexed" : true, "lang" : "FOREIGN", "hungarian" : false, "published" : true, "oldId" : 1326, "snippet" : true }, "volume" : "251", "firstPage" : "155", "lastPage" : "159", "firstPageOrInternalIdForSort" : "155", "pageLength" : 5, "publishedYear" : 2018, "abstractText" : "A matching in a hypergraph [Formula presented] is a set of pairwise disjoint hyperedges. The matching number [Formula presented] of [Formula presented] is the size of a maximum matching in [Formula presented]. A subset [Formula presented] of vertices of [Formula presented] is a dominating set of [Formula presented] if for every [Formula presented] there exists [Formula presented] such that [Formula presented] and[Formula presented] lie in a hyperedge of [Formula presented]. The cardinality of a minimum dominating set of [Formula presented] is called the domination number of [Formula presented], denoted by [Formula presented]. It is known that for an intersecting hypergraph [Formula presented] with rank [Formula presented], [Formula presented]. In this paper we present structural properties on intersecting hypergraphs with rank [Formula presented] satisfying the equality [Formula presented]. By applying these properties we show that all linear intersecting hypergraphs [Formula presented] with rank 4 satisfying [Formula presented] can be constructed by the well-known Fano plane. © 2018 Elsevier B.V.", "keywords" : [ { "otype" : "Keyword", "mtid" : 1015501, "link" : "/api/keyword/1015501", "label" : "Hypergraph", "published" : true, "oldId" : 1015501, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1015501, "link" : "/api/keyword/1015501", "label" : "Hypergraph", "published" : true, "oldId" : 1015501, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1016163, "link" : "/api/keyword/1016163", "label" : "Mathematical techniques", "published" : true, "oldId" : 1016163, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1016204, "link" : "/api/keyword/1016204", "label" : "Graph theory", "published" : true, "oldId" : 1016204, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1019650, "link" : "/api/keyword/1019650", "label" : "Matching", "published" : true, "oldId" : 1019650, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1019650, "link" : "/api/keyword/1019650", "label" : "Matching", "published" : true, "oldId" : 1019650, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1068820, "link" : "/api/keyword/1068820", "label" : "Dominating sets", "published" : true, "oldId" : 1068820, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1072849, "link" : "/api/keyword/1072849", "label" : "Combinatorial mathematics", "published" : true, "oldId" : 1072849, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1173739, "link" : "/api/keyword/1173739", "label" : "Domination number", "published" : true, "oldId" : 1173739, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1173743, "link" : "/api/keyword/1173743", "label" : "Domination", "published" : true, "oldId" : 1173743, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1173743, "link" : "/api/keyword/1173743", "label" : "Domination", "published" : true, "oldId" : 1173743, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1206029, "link" : "/api/keyword/1206029", "label" : "Maximum matchings", "published" : true, "oldId" : 1206029, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1346971, "link" : "/api/keyword/1346971", "label" : "Linear hypergraph", "published" : true, "oldId" : 1346971, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1546952, "link" : "/api/keyword/1546952", "label" : "Intersecting hypergraph", "published" : true, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1546953, "link" : "/api/keyword/1546953", "label" : "Matching numbers", "published" : true, "snippet" : true }, { "otype" : "Keyword", "mtid" : 1546954, "link" : "/api/keyword/1546954", "label" : "Minimum dominating set", "published" : true, "snippet" : true } ], "digital" : null, "printed" : null, "sourceYear" : 2019, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : false, "nationalOrigin" : null, "missingAuthor" : false, "oaType" : "NONE", "oaCheckDate" : "2023-03-23", "oaFree" : false, "citationCount" : 0, "citationCountUnpublished" : 0, "citationCountWoOther" : 0, "independentCitCountWoOther" : 0, "doiCitationCount" : 0, "wosCitationCount" : 0, "scopusCitationCount" : 0, "independentCitationCount" : 0, "unhandledCitationCount" : 0, "citingPubCount" : 0, "independentCitingPubCount" : 0, "unhandledCitingPubCount" : 0, "citedPubCount" : 7, "citedCount" : 7, "ratings" : [ { "otype" : "SjrRating", "mtid" : 10742288, "link" : "/api/sjrrating/10742288", "label" : "sjr:Q2 (2018) Scopus - Applied Mathematics DISCRETE APPLIED MATHEMATICS 0166-218X", "listPos" : 143, "rankValue" : 0.49, "type" : "journal", "ratingType" : { "otype" : "RatingType", "mtid" : 10002, "link" : "/api/ratingtype/10002", "label" : "sjr", "code" : "sjr", "published" : true, "snippet" : true }, "subject" : { "otype" : "ClassificationExternal", "mtid" : 2604, "link" : "/api/classificationexternal/2604", "label" : "Scopus - Applied Mathematics", "published" : true, "oldId" : 2604, "snippet" : true }, "ranking" : "Q2", "calculation" : "DIRECT", "published" : true, "snippet" : true } ], "ratingsForSort" : "Q2", "referenceList" : "Acharya, B.D., Domination in hypergraphs (2007) AKCE J. Combin., 4, pp. 117-126 ;\n Acharya, B.D., , pp. 1-16. , Domination in hypergraphs II. New directions, in: Proc. Int. Conf.-ICDM 2008, Mysore, India ;\n Aharoni, R., Argue, C.J., Covers in partitioned intersecting hypergraphs (2016) European J. Combin., 51, pp. 222-226 ;\n Alon, N., Transversal numbers of uniform hypergraphs (1990) Graphs Combin., 6, pp. 1-4 ;\n Arumugam, S., Jose, B., Bujtás, C., Tuza, Z., Equality of domination and transversal numbers in hypergraphs (2013) Discrete Appl. Math., 161, pp. 1859-1867 ;\n Bujtás, C., Henning, M.A., Tuza, Z., Transversals and domination in uniform hypergraphs (2012) European J. Combin., 33, pp. 62-71 ;\n Chvátal, V., McDiarmid, C., Small transversals in hypergraphs (1992) Combinatorica, 12, pp. 19-26 ;\n Das, S., Sudakov, B., Most probably intersecting hypergraphs (2015) Electron. J. Combin., 22 (1), p. #P 1.80 ;\n Dorfling, M., Henning, M.A., Linear hypergraphs with large transversal number and maximum degree two (2014) European J. Combin., 36, pp. 231-236 ;\n Erdös, P., Ko, C., Rado, R., Intersection theorems for systems of finite sets (1961) Q. J. Math., 12 (2), pp. 313-320 ;\n Frankl, P., Füredi, Z., Finite projective spaces and intersecting hypergraphs (1986) Combinatorica, 6, pp. 335-354 ;\n Füredi, Z., Matchings and covers in hypergraphs (1988) Graphs Combin., 4, pp. 115-206 ;\n Guiduli, B., Kirfily, Z., On intersecting hypergraphs (1998) Discrete Math., 182, pp. 139-151 ;\n Haynes, T.W., Hedetniemi, S.T., Slater, P.J., (1998) Fundamentals of Domination in Graphs, , Marcel Dekker, Inc. New York ;\n Henning, M.A., Löwenstein, C., Hypergraphs with large domination number and edge sizes at least 3 (2012) Discrete Appl. Math., 160, pp. 1757-1765 ;\n Henning, M.A., Löwenstein, C., Hypergraphs with large transversal number and with edge sizes at least four (2012) Cent. Eur. J. Math., 10 (3), pp. 1133-1140 ;\n Henning, M.A., Yeo, A., Hypergraphs with large transversal number and with edge sizes at least three (2008) J. Graph Theory, 59, pp. 326-348 ;\n Henning, M.A., Yeo, A., Transversals and matchings in 3-uniform hypergraphs (2013) European J. Combin., 34, pp. 217-228 ;\n Henning, M.A., Yeo, A., Matching critical intersecting hypergraphs (2014) Quest. Math., 37, pp. 127-138 ;\n Hilton, A.J.W., Milner, E.C., Some intersection theorems for systems of finite sets (1967) Q. J. Math., 18 (2), pp. 369-384 ;\n Jose, B.K., Tuza, Z., Hypergraph domination and strong independence (2009) Appl. Anal. Discrete Math., 3, pp. 237-358 ;\n Kang, L., Li, S., Dong, Y., Shan, E., Matching and domination numbers in [Formula presented]-uniform hypergraphs (2017) J. Comb. Optim., 34, pp. 656-659 ;\n Kano, M., Wu, Y., Yu, Q., Star-uniform graphs (2010) Graphs Combin., 26, pp. 383-394 ;\n Laskar, R., Valikar, H.B., On domination related concepts in graph theory (1981) Combinatorics and Graph Theory, Lecture Notes in Mathematics, 885, pp. 308-320. , Rao S.B. Springer Berlin ;\n Mansour, T., Song, C., Yuster, R., A comment on Ryser's conjecture for intersecting hypergraphs (2009) Graphs Combin., 25, pp. 101-109 ;\n Randerath, B., Volkmann, L., Characterization of graphs with equal domination and covering number (1998) Discrete Math., 191, pp. 159-169 ;\n Randerath, B., Volkmann, L., Characterization of graphs with equal domination and matching number (1999) Util. Math., 55, pp. 65-72 ;\n Shan, E.F., Dong, Y.X., Kang, L.Y., Li, S., Extremal hypergraphs for matching number and domination number (2018) Discrete Appl. Math., 236, pp. 415-421 ;\n Wu, Y., Yu, Q., A characterization of graphs with equal domination number and vertex cover number (2012) Bull. Malays. Math. Sci. Soc. (2), 35, pp. 803-806", "hasCitationDuplums" : false, "userChangeableUntil" : "2019-04-21T16:55:37.162+0000", "publishDate" : "2019-01-21T17:55:37.268+0000", "directInstitutesForSort" : "", "ownerAuthorCount" : 5, "ownerInstituteCount" : 22, "directInstituteCount" : 0, "authorCount" : 4, "contributorCount" : 0, "hasQualityFactor" : true, "link" : "/api/publication/30384508", "label" : "Dong Y. et al. Domination in intersecting hypergraphs. (2018) DISCRETE APPLIED MATHEMATICS 0166-218X 1872-6771 251 155-159", "template" : "