Advertisement

Order

, Volume 21, Issue 4, pp 283–292 | Cite as

Characterizing Flag Graphs and Induced Subgraphs of Cartesian Product Graphs

  • Iztok Peterin
Article

Abstract

The vertices of the flag graph Φ(P) of a graded poset P are its maximal chains. Two vertices are adjacent whenever two maximal chains differ in exactly one element. In this paper we characterize induced subgraphs of Cartesian product graphs and flag graphs of graded posets. The latter class of graphs lies between isometric and induced subgraphs of Cartesian products in the embedding structure theory. Both characterization use certain edge-labelings of graphs.

Keywords

flag graphs induced subgraphs edge-labellings Cartesian product graphs quotient graphs 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abels, H.: The gallery distance of flags, Order 8 (1991), 77–92. CrossRefGoogle Scholar
  2. 2.
    Abels, H.: The geometry of the chamber systems of a semimodular lattice, Order 8 (1991), 143–158. CrossRefGoogle Scholar
  3. 3.
    Björner, A.: Shellable and Cohen–Macaulay partially ordered sets, Trans. Amer. Math. Soc. 260 (1980), 159–183. Google Scholar
  4. 4.
    Björner, A.: The minimum number of faces of a simple polyhedron, European J. Combin. 1 (1980), 27–31. Google Scholar
  5. 5.
    Djoković, D.: Distance preserving subgraphs of hypercubes, J. Combin. Theory Ser. B 14 (1973) 263–267. CrossRefGoogle Scholar
  6. 6.
    Feder, T.: Product graph representations, J. Graph Theory 16 (1992), 467–488. Google Scholar
  7. 7.
    Feder, T.: Stable networks and product graphs, Mem. Amer. Math. Soc. 116(555) (1995). Google Scholar
  8. 8.
    Graham, R. L. and Winkler, P. M.: On isometric embeddings of graphs, Trans. Amer. Math. Soc. 288 (1985), 527–536. Google Scholar
  9. 9.
    Hedetniemi, S. T. and Slater, P. J.: Line graphs of triangleless graphs and iterated clique graphs, In: Graph Theory and Applications, Lecture Notes in Math. 303, Springer, Berlin, 1972, pp. 139–147. Google Scholar
  10. 10.
    Herscovici, D. S.: Minimal paths between maximal chains in finite rank semimodular lattice, J. Algebraic Combin. 7 (1998), 17–37. CrossRefGoogle Scholar
  11. 11.
    Herscovici, D. C.: Semimodular lattice and semibuildings, J. Algebraic Combin. 7 (1998),39–51. CrossRefGoogle Scholar
  12. 12.
    Imrich, W.: Embedding graphs into Cartesian products, Ann. New York Acad. Sci. 576 (1989), 266–274. Google Scholar
  13. 13.
    Imrich, W. and Klavžar, S.: Product Graphs: Structure and Recognition, Wiley, New York, 2000. Google Scholar
  14. 14.
    Klavžar, S., Lipovec, A. and Petkovšek, M.: On subgraphs of Cartesian product graphs, Discrete Math. 244 (2002), 223–230. CrossRefGoogle Scholar
  15. 15.
    Klavžar, S. and Peterin, I.: Characterizing subgraphs of Hamming graphs, J. Graph Theory, in press. Google Scholar
  16. 16.
    Prisner, E.: Flag graphs of pure posets, Manuscript, 1993. Google Scholar
  17. 17.
    Staton, W. and Wingard, C. G.: On line graphs of bipartite graphs, Utilitas Math. 53 (1998), 183–187. Google Scholar
  18. 18.
    Winkler, P.: Isometric embeddings in products of complete graphs, Discrete Appl. Math. 7 (1984), 221–225. CrossRefGoogle Scholar

Copyright information

© Springer 2005

Authors and Affiliations

  1. 1.Faculty of Electrical Engineering and Computer ScienceUniversity of MariborMariborSlovenia

Personalised recommendations