×

zbMATH — the first resource for mathematics

A bibliography of graph equations. (English) Zbl 0423.05038

MSC:
05C99 Graph theory
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Acharya, Results announced, Graph Theory Newslett. 2 (2) pp 4– (1972)
[2] Acharay, Partition graphs and caracterization of tensorproduct graphs, Abstract, Graph Theory Newslett. 4 (6) pp 65– (1975)
[3] Acharya, On notions concerning n-path graphs, J. Combinatoral Theory · Zbl 0703.05035
[4] Acharya, Open neighbourhood graphs, Abstract, Graph Theory Newslett. 2 (4) pp 1– (1973)
[5] Acharya, On the isomorphism of N(G) and L(G), Announcement, Graph Theory Newslett. 3 (2) pp 1– (1973)
[6] Acharya, A notion of convergence in graph theory, Abstract, Graph Theory Newslett. 4 (5) pp 48– (1975)
[7] Aigner, On the line graph of a directed graph, Math. Z. 102 pp 56– (1967) · Zbl 0158.20901 · doi:10.1007/BF01110285
[8] Aigner, Graphs whose complement and line graph are isomorphic, J. Combinatorial Theory 7 pp 273– (1969) · Zbl 0186.27505
[9] Akiyama, On characterization of the middle graphs, GRU Math. 11 pp 35– (1975)
[10] Akiyama, Graph equations for line graphs, total graphs and middle graphs, TRU Math. 12 (2) pp 31– (1976) · Zbl 0402.05058
[11] Akiyama, A solution of graph equation for line graphs, TRU Math. 12 (2) pp 35– (1976)
[12] Akiyama, Graph equations for line graphs and n-th power graphs I, Publ. Inst. Math. (Beograd) 23 (37) pp 5– (1978) · Zbl 0408.05046
[13] Behzad, A characterization of total graphs, Proc. Amer. Math. Soc. 26 pp 383– (1970) · Zbl 0203.56802 · doi:10.1090/S0002-9939-1970-0266786-5
[14] Behzad, Graph Theory and Applications pp 21– (1972) · doi:10.1007/BFb0067353
[15] Behzad, The total group of a graph, Proc. Amer. Math. Soc. 19 pp 158– (1968) · Zbl 0175.20805 · doi:10.1090/S0002-9939-1968-0218271-5
[16] Behzad, Structure of regular total graphs, J. London Math. Soc. 44 pp 433– (1967) · Zbl 0167.52104
[17] Beineke, Beiträge zur Graphentheorie pp 17– (1968)
[18] Beineke, Characterizatios of derived graphs, J. Combinatorial Theory 9 pp 129– (1970) · Zbl 0202.55702
[19] Beineke, Recent Trends in Graph Theory pp 15– (1971) · doi:10.1007/BFb0059419
[20] Beineke, Infinite digraphs isomorphic with their line digraphs, J. Combinatorial Theory Ser. B 21 pp 245– (1976) · Zbl 0297.05115 · doi:10.1016/S0095-8956(76)80008-1
[21] Beneike, Locally finite self-interchange graphs, Proc. Amer. Math. Soc. 27 pp 8– (1971) · doi:10.1090/S0002-9939-1971-0289349-5
[22] Bermond, Graph représentatif des arrrctes d’un multigraphe, J. Math. Pures Appl. 52 pp 299– (1973)
[23] Best, Problem 459, Nieuw Arch. Wisk. 25 (3) pp 434– (1977)
[24] Borowiecki, O pewnych wasnosaciach operacji boolowskich dwóch grafów, Prace Nauk. Inst. Mat. Fiz. Teoret. Politechn. Wroclaw Ser. Studia i Materiay 4 pp 17– (1972)
[25] Borowiecki, Grafy regularne i grafy dualne a operacje binarne na grafach, Biul. W. S. Inza. Zieloney Gorze 10 pp 13– (1972)
[26] Borowiecki, On pewnych wasnosaciach grafów dualnych, Discuss. Math. 21 (1) pp 7– (1975)
[27] Bosák, Directed graphs and matrix equations, Abstract, Graph Theory Newslett. 6 (6) pp 2– (1977)
[28] Burns, Every (p, p-2) graph is contained in its complement, J. Graph Theory 1 (3) pp 277– (1977) · Zbl 0375.05046 · doi:10.1002/jgt.3190010308
[29] Capobianco, Tournaments and tensor product of digraphs, SIAM J. Appl. Math. 15 pp 624– (1967) · Zbl 0152.22803 · doi:10.1137/0115053
[30] Capobianco, Tensor products of digraphs and the structure of groups of pairs, Bull. Math. Biophys. 31 pp 319– (1969) · Zbl 0176.22503 · doi:10.1007/BF02477009
[31] Capobianco, On characterizing tensor composite graphs, Ann. N. Y. Acad. Sci. 175 (1) pp 80– (1970) · Zbl 0228.05130
[32] Capobianco, Combinatorial Structures and Their Applications pp 27– (1970)
[33] Capobianco, Some theorems on tensor composite graphs, J. Res. Nat. Bur. Standards Sect. B 74 pp 235– (1970) · Zbl 0209.55302 · doi:10.6028/jres.074B.021
[34] Capobianco, Graph equations, Ann. N. Y. Acad. Sci. · Zbl 0483.05058
[35] Catlin, Vertex neighborhood families of graphs, Abstract, Graph Theory Newslett. 7 (3) pp 1– (1978)
[36] Chartrand, Total digraphs, Canad. Math. Bull. 9 pp 171– (1966)
[37] Chikkodimath, On semitotal clique graphs of a graph, Abstract, Graph Theory Newslett. 4 (1) pp 2– (1974)
[38] Chinn, ongressus umerantium Utilitas Mathematica, Winnipeg (1975) No. 13, in: Proceedings of the Conference on Algebraic Aspects of Combinatorics pp 207– (1975)
[39] Cvetković, Spectrum of the total graph of a graph, Publ. Inst. Math. (Beograd) 16 (30) pp 49– (1973) · Zbl 0274.05118
[40] Cvetković, On self pseudoinverse graphs, Univ. Beograd, Publ. Elektrotehn. Fak. Ser. Mat. Fiz.
[41] Cvetković, Graph equations, graph inequalities and a fixed point theorem, Publ. Inst. Math. (Beograd) 20 (34) pp 59– (1976)
[42] Cvetković, XVII Internationales Wissenschaftliches Kolloquim pp 57– (1973)
[43] Cvetković, Some remarks on the complement of a line graph, Publ. Inst. Math (Beograd) 17 (3) pp 37– (1974) · Zbl 0295.05119
[44] Cvetković, Graph equations for line graphs and total graphs, Discrete Math. 13 pp 315– (1975) · Zbl 0315.05126 · doi:10.1016/0012-365X(75)90054-0
[45] Cvetković, Graphs which are switching equivalent to their line graphs, Publ. Inst. Math. (Beograd) 23 (37) pp 39– (1978)
[46] Cvetković, Beiträge zur Graphentheorie und deren Anwendungen pp 40– (1978)
[47] Doob, A note on prime graphs, Utilitas Math. 9 pp 297– (1976)
[48] Dörfler, Zum Kroneckerprodukt von endlichen Graphen, Glasnik Mat. Ser. III 6 (26) pp 217– (1971)
[49] Dörfler, Primfaktorzerlegung und Automorphismen des Kardinalproduktes von Graphen, Glasnik Mat. Ser. III 9 (29) pp 15– (1974) · Zbl 0284.05124
[50] Dörfler, Über das starke Produkt von endlichen Graphen, Österreich. Akad. Wiss. Math.-Naturwiss. Kl. S.-B. II 178 pp 247– (1970) · Zbl 0194.56202
[51] Dörfler, Das lexilkographische Produkt gerichteter Graphen, Monatsch. Math. 76 pp 21– (1972) · Zbl 0234.05109 · doi:10.1007/BF01301004
[52] Dulmage, Gaps in the exponent set of primitive matrices, Illinois J. Math. 8 pp 642– (1964) · Zbl 0125.00706
[53] Dulmage, Graph Theory and Theoretical Physics pp 167– (1967)
[54] Escalante, Über iterierte Clique-Graphen, Abh. Math. Sem. Univ. Hamburg 39 pp 56– (1973) · Zbl 0266.05116
[55] Fscalante, Trees and n-path invariant graphs, Graph Theory Newslett. 3 (3) pp 2– (1974)
[56] Escalante, Correction announcement, Graph Theory Newslett. 3 (3) pp 7– (1974)
[57] Escalante, Characterization of n-path graphs and of graphs having n-th root, J. Combinatorial Theory Ser. B 16 pp 282– (1974) · Zbl 0268.05118 · doi:10.1016/0095-8956(74)90074-4
[58] Escalante, Just two total graphs are complementary, Monatsch. Math. 81 (1) pp 5– (1976) · Zbl 0345.05122 · doi:10.1007/BF01473611
[59] Ghirlanda, Osservazioni sulle caratteristiche del grafi o singrammi, Ann. Univ. Ferrara Sez. VII 11 pp 93– (1962-1965)
[60] Greenwell, Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing pp 345– (1977)
[61] Gudagudi, On subdivision graphs, Karnatak Univ., Graph Theory Res. Rep. 1 pp 71– · Zbl 0389.05046
[62] Gudagudi, On n-th subdivision graphs, J. Karnatak Univ. Sci. 19 pp 282– (1974) · Zbl 0314.05107
[63] Hall, Problem 495, Nieuw Arch. Wisk. 26 (1) pp 233– (1978)
[64] Hamelink, A partial characterization of clique graphs, J. Combinatorial Theory 5 pp 192– (1968) · Zbl 0167.22203
[65] Harary, A. Characterization of block-graphs, Canad. Math. Bull. 6 pp 1– (1963)
[66] F. Harary Graph Theory. 1969
[67] Harary, Some properties of line digraphs, Rend. Circ. Mat. Palermo 9 (2) pp 161– (1960) · Zbl 0099.18205
[68] Harary, The block-cutpoint-tree of a graph, Publ. Math. Debrecen 13 pp 103– (1966) · Zbl 0168.44704
[69] Hedetniemi, Graph Theory and Applications pp 139– (1972) · doi:10.1007/BFb0067365
[70] Hemminger, Isomorphism-induced line isomorphisms on pseudo-graphs, Czechoslovak Math. J. 21 (96) pp 672– (1971)
[71] Hemminger, Characterizations of the line graph a multigraph, Notices Amer. Math. soc. 18 pp 934– (1971)
[72] Hemminger, Graph Theory and Applications pp 149– (1972) · doi:10.1007/BFb0067366
[73] Hemminger, Digraphs with periodic line digraphs, Studia Sci. Math. Hungar. 9 pp 27– (1974) · Zbl 0304.05112
[74] Hemminger, Line pseudo-digraphs, J. Graph Theory 1 (4) pp 365– (1977) · Zbl 0379.05032 · doi:10.1002/jgt.3190010411
[75] Hemminger, Line isomorphisms on dipseudographs, J. Combinatorial Theory Ser. B 14 pp 105– (1973) · Zbl 0263.05107 · doi:10.1016/0095-8956(73)90053-1
[76] Hoffman, On the polynomial of a graph, Amer. Math. Monthly 20 pp 30– (1963) · Zbl 0112.14901 · doi:10.2307/2312780
[77] Hoffman, On Moore graphs with diameter 2 and 3, IBM J. Res. Develop. 4 pp 497– (1960) · Zbl 0096.38102
[78] Imrich, Über das lexikogrpahische Produkt von Graphen, Arch. Math. (Basel) 20 (3) pp 228– (1969) · Zbl 0183.28501
[79] Imrich, On products of graphs and regular groups, Israel J. Math. 11 (3) pp 258– (1972) · Zbl 0233.05113
[80] Klerlein, Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing pp 429– (1975)
[81] Knuth, Notes on central groupoids, J. Combinatorial Theory 8 pp 376– (1970) · Zbl 0192.34501
[82] Krausz, Démonstration nouvelle d’une théorème de Whitney sur les réseaux, Mat. Fiz. Lapok 50 pp 17– (1943)
[83] Kulli, Some relations between block graphs and interchange graphs, J. Karnatak Univ. Sci. 16 pp 59– (1971) · Zbl 0293.05147
[84] Kulli, Interchange graphs and block graphs, J. Karnatak Univ. Sci. 16 pp 63– (1971) · Zbl 0293.05148
[85] Kulli, A theorem on graphs, Math. Education 7 pp A43– (1973) · Zbl 0286.05125
[86] Kulli, On block-cutvertex-trees, interchange graphs, and block graphs, J. Karnatak Univ. Sci. 18 pp 315– (1973) · Zbl 0286.05123
[87] V. R. Kulli Graph equations for line graphs, total block graphs, and semitotal block graphs · Zbl 0664.05056
[88] V. R. Kulli N. S. Annigeri The c -tree and total- c -tree of a graph
[89] Lam, On some solutions of Ak = Dl + J. J. Combinatorial Theory Ser. A 23 (2) pp 140– (1977) · Zbl 0354.05022 · doi:10.1016/0097-3165(77)90036-X
[90] Lam, Directed graphs with unique paths of fixed length, J. Combinatorial Theory Ser. B 24 pp 331– (1978) · Zbl 0319.05112 · doi:10.1016/0095-8956(78)90052-7
[91] Lovász, On the cancellation law among finite relational structures, Period Math. Hunger. 1 (2) pp 145– (1971) · Zbl 0223.08002 · doi:10.1007/BF02029172
[92] Z. Lukić Representation of a graph as a product of graphs 1977
[93] Marczyk, Characterizing line graphs of general graphs, Bull. Acad. Polon. Sci Sér. Sci. Math. Astronom. Phys. 22 pp 235– (1974) · Zbl 0282.05116
[94] McKenzie, Cardinal multiplication of structures with a reflexive relation, Fund. Math. 70 (1) pp 59– (1971) · Zbl 0228.08002
[95] A. N. Melihov Directed graphs and finite automata 1971
[96] Mendelsohn, Combinatorial Theory and Its Applications II pp 783– (1970)
[97] Menon, The isomorphism between graphs and their adjoint graphs, Canad. Math Bull. 8 pp 7– (1965)
[98] Menon, On repeated interchange graphs, Amer. Math. Monthly 73 pp 986– (1966) · Zbl 0144.45403 · doi:10.2307/2314503
[99] Menon, Theory of Graphs pp 245– (1967)
[100] Menon, ON repeated interchange graphs II, J. Combinatorial Theory Ser. B. 11 pp 54– (1971) · Zbl 0218.05066 · doi:10.1016/0095-8956(71)90013-X
[101] Miller, The categorical product of graphs, Canad. J. Math. 20 pp 1511– (1968)
[102] Mukhopadyay, The square root of a graph, J. Combinatorial Theory 2 pp 290– (1967)
[103] Naik, Solutions to some further graph equations, Discrete Math.
[104] Nieminen, On the conjuction of undirected graphs, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 22 pp 1– (1974) · Zbl 0273.05125
[105] R. O’Beirns Digraphs whose line digraphs are isomorphic to their converses
[106] Palmer, Prime line graphs, Nanta Math. 6 (2) pp 75– (1973) · Zbl 0279.05126
[107] Rao, Remarks on semitotal graphs of a graph, Abstract, Graph Theory Newslett. 3 (3) pp 4– (1974)
[108] Reid, Connectivity in products of graphs, SIAM J. Appl. Math. 18 (3) pp 645– (1970) · Zbl 0198.57101 · doi:10.1137/0118057
[109] Roberts, Characterization of clique-graphs, J. Combinatorial Theory Ser. B 10 pp 102– (1971) · Zbl 0215.05801
[110] Sabidussi, Graph multiplication, Math. Z 72 pp 446– (1960) · Zbl 0093.37603 · doi:10.1007/BF01162967
[111] Sabidussi, Graph derivatives, Math. Z. 76 pp 385– (1961) · Zbl 0109.16404 · doi:10.1007/BF01210984
[112] Sampathkumar, On the line graph of subdivision graph, J. Karnatak Univ. Sci. 17 pp 259– (1972) · Zbl 0282.05115
[113] Sampathkumar, On tensor product graphs, J. Austral. Math. Soc. 20 (3) pp 268– (1975) · Zbl 0312.05119
[114] Sampathkumar, Semitotal graphs of a graph I, J. Karnatak Univ. Sci. 18 pp 274– (1973) · Zbl 0287.05121
[115] Sampathkumar, Semitotal graphs of a graph II, J. Karantak Univ. Sci. 18 pp 281– (1973) · Zbl 0287.05121
[116] Sampathkumar, Semitotal digraphs of a digraph, Announcement, Graph Theory Newslett. 3 (3) pp 5– (1974)
[117] Schwartz, On interchange graphs, Pacific J. Math. 27 pp 393– (1968) · Zbl 0174.55202
[118] Schwartz, Infinite self-interchange graphs, Pacific J. Math. 31 pp 497– (1969) · Zbl 0187.21202
[119] S. Simić 1975
[120] S. Simić Graph equation L n G Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz. 498 541 1975
[121] Simić, On decomposition of line (total) graphs with respect to some binary operations, Publ. Inst. Math. (Beograd) 24 (38) pp 163– (1978)
[122] S. K. Simić Graphs which are switching equivalent to their complementary line graphs I
[123] S. K. Simić Some contributions to the investigation of graph operations
[124] Simões-Pereira, On the Boolean matrix equation, J. Assoc. Comput. Math. 12 pp 376– (1965)
[125] J. Assoc. Comput. Math. 14 pp 419– (1967)
[126] Sugiyama, On the point-line graph of a graph, Sci. Rep. Fac. Ed. Gifu Univ. Natur. Sci. 4 pp 287– (1975)
[127] Trnková, On products of binary relational structures, Comment. Math. Univ. Carolinae 17 (3) pp 513– (1976) · Zbl 0361.08002
[128] van Rooij, The interchange graphs of a finite graph, Acta Math. Acad. Sci. Hungar. 16 pp 263– (1965) · Zbl 0139.17203 · doi:10.1007/BF01904834
[129] Whitney, Congruent graphs and the connectivity of graphs, Amer. J. Math. 54 pp 150– (1932) · JFM 58.0609.01 · doi:10.2307/2371086
[130] Zamfirescu, Disconnected digraphs isomorphic with their line digraphs, Bull. Un. Mat. Ital. 4 (4) pp 888– (1971) · Zbl 0236.05113
[131] Zelinka, Intersection graphs of graphs, Mat. Časopis Sloven. Akad. Vied. 25 (2) pp 129– (1975) · Zbl 0309.05128
[132] Zelinka, Isomorphism of polar and polarized graphs, Czechoslovak Math. J. 26 (101) pp 352– (1976) · Zbl 0341.05121
[133] Zelinka, Self-derived polar graphs, Czeckoslovak Math. J. 26 (101) pp 365– (1976) · Zbl 0341.05124
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.