Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Complement of a graph: a generalization

From MaRDI portal
Publication:1272536
Jump to:navigation, search

DOI10.1007/BF02351593zbMath0914.05056MaRDI QIDQ1272536

E. Sampathkumar, L. Pushpa Latha

Publication date: 6 June 1999

Published in: Graphs and Combinatorics (Search for Journal in Brave)


zbMATH Keywords

partition\(k\)-complement


Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)


Related Items

Powers of cycle graph which are k-self complementary and k-co-self complementary ⋮ Commuting decomposition of \(K_{n_1,n_2,\dots,n_k}\) through realization of the product \(A(G)A\left(G^P_k\right)\) ⋮ Characterisation of potentially generalised bipartite self-complementary bi-graphic sequences ⋮ Partial Complement of a Graph



Cites Work

  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1272536&oldid=13376895"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 10:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki