Knowledge (XXG)

Graph equation

Source 📝

280: 242: 204: 349:
Graph equations, graph inequalities and a fixed point theorem, DM Cvetkovic, IB Lackovic, SK Simic – Publ. Inst. Math.(Belgrade)., 1976 – elib.mi.sanu.ac.yu, PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE Nouvelle série, tome 20 (34),
375:
More Results on the Graph Equation G2= G, M Capobianco, SR Kim – Graph Theory, Combinatorics, and Algorithms: Proceedings of …, 1995 – Wiley-Interscience
310: 272: 234: 395: 279: 241: 203: 355: 368: 342: 40: 413: 363: 55: 378:
Graph equation Ln (G)= G, S Simic - Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz, 1975
48: 44: 288: 250: 212: 407: 328: 51:) The graphs in question may be expressed differently in terms of graph equations. 28: 340:
Graph equations for line graphs and total graphs, DM Cvetkovic, SK Simic –
75: 17: 67: 36: 353:
Graphs whose complement and line graph are isomorphic, M Aigner –
43:. One of the central questions of graph theory concerns the notion of 291: 253: 215: 304: 266: 228: 47:. We ask: When are two graphs the same? (i.e., 8: 362:Solutions of some further graph equations, 296: 290: 258: 252: 220: 214: 131:are the solutions of the graph equation 175:are the solutions of the graph equation 388: 199: 7: 25: 396:Bibliography on Graph equations 278: 240: 202: 356:Journal of Combinatorial Theory 1: 430: 372:, 47 (1983) 169–175 39:in which the unknowns are 366:, Ranjan N. Naik – 306: 268: 230: 364:Vasanti N. Bhat-Nayak 335:Selected publications 307: 305:{\displaystyle K_{4}} 269: 267:{\displaystyle K_{3}} 231: 229:{\displaystyle K_{2}} 54:What are the graphs ( 369:Discrete Mathematics 343:Discrete Mathematics 289: 251: 213: 302: 264: 226: 49:graph isomorphism 16:(Redirected from 421: 398: 393: 311: 309: 308: 303: 301: 300: 282: 273: 271: 270: 265: 263: 262: 244: 235: 233: 232: 227: 225: 224: 206: 21: 429: 428: 424: 423: 422: 420: 419: 418: 404: 403: 402: 401: 394: 390: 385: 337: 331:on 6 vertices. 326: 312: 292: 287: 286: 283: 274: 254: 249: 248: 245: 236: 216: 211: 210: 207: 196: 185: 174: 163: 152: 141: 130: 119: 74:is same as the 33:Graph equations 23: 22: 18:Graph equations 15: 12: 11: 5: 427: 425: 417: 416: 406: 405: 400: 399: 387: 386: 384: 381: 380: 379: 376: 373: 360: 351: 347: 336: 333: 324: 314: 313: 299: 295: 284: 277: 275: 261: 257: 246: 239: 237: 223: 219: 208: 201: 194: 183: 172: 161: 150: 139: 128: 117: 66:such that the 24: 14: 13: 10: 9: 6: 4: 3: 2: 426: 415: 412: 411: 409: 397: 392: 389: 382: 377: 374: 371: 370: 365: 361: 358: 357: 352: 348: 345: 344: 339: 338: 334: 332: 330: 329:regular graph 323: 319: 297: 293: 281: 276: 259: 255: 243: 238: 221: 217: 205: 200: 198: 193: 189: 182: 178: 171: 167: 160: 156: 149: 145: 138: 134: 127: 123: 116: 112: 109:For example, 107: 105: 101: 97: 93: 89: 85: 81: 77: 73: 69: 65: 61: 57: 52: 50: 46: 42: 38: 34: 30: 19: 414:Graph theory 391: 367: 354: 341: 321: 317: 315: 191: 187: 180: 176: 169: 165: 158: 154: 147: 143: 136: 132: 125: 121: 114: 110: 108: 106:) ?). 103: 99: 95: 91: 87: 83: 82:? (What are 79: 71: 63: 59: 53: 32: 29:graph theory 26: 90:such that 76:total graph 45:isomorphism 383:References 316:Note that 68:line graph 327:) is a 4- 56:solutions 37:equations 408:Category 359:, 1969 346:, 1975 164:, and 153:) and 142:) = 120:, and 41:graphs 350:1976, 186:) = 98:) = 86:and 62:and 35:are 285:::: 247:::: 209:::: 197:). 78:of 70:of 27:In 410:: 168:= 157:= 124:= 113:= 58:) 325:3 322:K 320:( 318:T 298:4 294:K 260:3 256:K 222:2 218:K 195:3 192:K 190:( 188:T 184:4 181:K 179:( 177:L 173:3 170:K 166:H 162:4 159:K 155:G 151:2 148:K 146:( 144:T 140:3 137:K 135:( 133:L 129:2 126:K 122:H 118:3 115:K 111:G 104:H 102:( 100:T 96:G 94:( 92:L 88:H 84:G 80:H 72:G 64:H 60:G 31:, 20:)

Index

Graph equations
graph theory
equations
graphs
isomorphism
graph isomorphism
solutions
line graph
total graph
:::'"`UNIQ--postMath-00000001-QINU`"'
:::'"`UNIQ--postMath-00000002-QINU`"'
:::'"`UNIQ--postMath-00000003-QINU`"'
regular graph
Discrete Mathematics
Journal of Combinatorial Theory
Vasanti N. Bhat-Nayak
Discrete Mathematics
Bibliography on Graph equations
Category
Graph theory

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.