{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:16:38Z","timestamp":1740104198739,"version":"3.37.3"},"reference-count":15,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2003,9,30]],"date-time":"2003-09-30T00:00:00Z","timestamp":1064880000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"name":"FONDECyT, Chile","award":["1030498 (to G.D.)"]},{"name":"UBACyT, Argentina","award":["X127 (to G.D. and M.C.L)","X036 (to M.C.L.)"]},{"name":"PID Conicet"},{"name":"Argentina","award":["644\/98 (to M.C.L)"]},{"name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico (to J.L.S)"},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Funda\u00e7\u00e3o de Amparo \u00e1 pesquisa do Estado do Rio de Janeiro, FAPERJ, Brasil (to J.L.S.)"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2003,11]]},"abstract":"Abstract<\/jats:title>The clique graph<\/jats:italic> of a graph is the intersection graph of its (maximal) cliques. A graph is self\u2010clique<\/jats:italic> when it is isomorphic with its clique graph, and is clique\u2010Helly<\/jats:italic> when its cliques satisfy the Helly property. We prove that a graph is clique\u2010Helly and self\u2010clique if and only if it admits a quasi\u2010symmetric<\/jats:italic> clique matrix, that is, a clique matrix whose families of row and column vectors are identical. We also give a characterization of such graphs in terms of vertex\u2010clique duality. We describe new classes of self\u2010clique and 2\u2010self\u2010clique graphs. Further, we consider some problems on permuted matrices (matrices obtained by permuting the rows and\/or columns of a given matrix). We prove that deciding whether a (0,1)\u2010matrix admits a symmetric (quasi\u2010symmetric) permuted matrix is graph (hypergraph) isomorphism complete. \u00a9 2003 Wiley Periodicals, Inc. J Graph Theory 44: 178\u2013192, 2003<\/jats:p>","DOI":"10.1002\/jgt.10496","type":"journal-article","created":{"date-parts":[[2003,10,13]],"date-time":"2003-10-13T07:05:31Z","timestamp":1066028731000},"page":"178-192","source":"Crossref","is-referenced-by-count":17,"title":["Self\u2010clique graphs and matrix permutations"],"prefix":"10.1002","volume":"44","author":[{"given":"Adrian","family":"Bondy","sequence":"first","affiliation":[]},{"given":"Guillermo","family":"Dur\u00e1n","sequence":"additional","affiliation":[]},{"given":"Min Chih","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2003,9,30]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"263","article-title":"Self\u2010clique graphs and diameters of iterated clique graphs","volume":"29","author":"Balakrishnan R.","year":"1986","journal-title":"Utilitas Mathematica"},{"key":"e_1_2_1_3_2","first-page":"360","article-title":"Caratterizzazione matriciale dei grafi autoduali","volume":"113","author":"Balconi G.","year":"1979","journal-title":"Istit Lombardo Accad Sci Lett Rend A"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00286-1"},{"key":"e_1_2_1_5_2","unstructured":"G.Cornue\u00b4jols Combinatorial Optimization: Packings and Coverings July2000.http:\/\/integer.gsia.cmu.edu\/webpub\/notes.pdf"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02992818"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90084-7"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/0134037"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(68)80055-9"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00054-H"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"E. M.Luks Hypergraph isomorphism and structural equivalence of boolean functions Proceedings of the ACM Symposium of Theory of Computing pp.652\u2013658 Atlanta Ge 1999.","DOI":"10.1145\/301250.301427"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02280884"},{"key":"e_1_2_1_13_2","first-page":"216","article-title":"Hereditary clique\u2010Helly graphs","volume":"14","author":"Prisner E.","year":"1993","journal-title":"J Combin Math Combin Comput"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(71)90070-0"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1137\/0601042"},{"key":"e_1_2_1_16_2","first-page":"29","article-title":"Recognizing clique\u2010Helly graphs","volume":"45","author":"Szwarcfiter J.","year":"1997","journal-title":"Ars Combin"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.10496","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.10496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T02:25:04Z","timestamp":1697595904000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.10496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9,30]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["10.1002\/jgt.10496"],"URL":"https:\/\/doi.org\/10.1002\/jgt.10496","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"type":"print","value":"0364-9024"},{"type":"electronic","value":"1097-0118"}],"subject":[],"published":{"date-parts":[[2003,9,30]]}}}