Since Google introduced the use of Knowledge Graphs to enhance search functionality and organize information internally, their adoption and application have grown significantly. Various technologies have been developed to implement Knowledge Graphs, like RDF, Property Graphs and Wikibase. The recent introduction of RDF 1.2 aims to bridge the gap between RDF and Property Graphs by enabling statements about statements, offering greater flexibility. Data quality is a critical aspect of Knowledge Graphs, often ensured through validation against predefined data models or shapes. This tutorial will explore several approaches developed for describing and validating RDF, such as ShEx and Shapes Constraint Language (SHACL). Notably, the Data Shapes Working Group has been tasked this year with developing SHACL 1.2, aligning it with RDF 1.2. We will briefly outline these approaches, highlighting their similarities, differences, and recent advancements. In the case of Property Graphs, PGSchema was proposed, as well as other proposals like PShEx or ProGS, and more recently GQL offers a way to define typed graphs. Wikidata adopted Entity Schemas, which are based on ShEx as well as its own property constraint system, and there is a proposal called WShEx. This tutorial will explore different types of Knowledge Graphs and approaches for their validation.