Almost Generalized Complements of a Graph.
Saved in:
| Title: | Almost Generalized Complements of a Graph. |
|---|---|
| Authors: | Amrithalakshmi1 amritha.lakshmi@manipal.edu, D'Souza, Sabitha1 sabitha.dsouza@manipal.edu, Nayak, Swati1 swati.nayak@manipal.edu |
| Source: | Engineering Letters. Mar2026, Vol. 34 Issue 3, p862-866. 5p. |
| Subjects: | Graph theory, Graph connectivity |
| Abstract: | Graphs are widely used in fields like computer vision, pattern recognition, and bio-informatics to represent structural information. Graph matching is crucial for analyzing relationships and optimizing connections. A perfect matching pairs all vertices, essential for scenarios requiring complete pairing. In real-world systems, not all connections can be reversed. The generalized complement creates a new graph based on specific conditions, while the almost complement allows selective structural modifications instead of complete reversal. This flexibility aids in understanding complex relationships and provides solutions that other modeling methods may not achieve. This paper introduces the concept of almost generalized complements of a graph, focusing on the partitioning of the vertex set and perfect matching. It also explores the relationship between the almost k-complement and the almost k(i)-complement of a graph. Additionally, some important properties of almost generalized complements are discussed. [ABSTRACT FROM AUTHOR] |
| Copyright of Engineering Letters is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 192025073 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Almost Generalized Complements of a Graph. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Amrithalakshmi%22">Amrithalakshmi</searchLink><relatesTo>1</relatesTo><i> amritha.lakshmi@manipal.edu</i><br /><searchLink fieldCode="AR" term="%22D'Souza%2C+Sabitha%22">D'Souza, Sabitha</searchLink><relatesTo>1</relatesTo><i> sabitha.dsouza@manipal.edu</i><br /><searchLink fieldCode="AR" term="%22Nayak%2C+Swati%22">Nayak, Swati</searchLink><relatesTo>1</relatesTo><i> swati.nayak@manipal.edu</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Engineering+Letters%22">Engineering Letters</searchLink>. Mar2026, Vol. 34 Issue 3, p862-866. 5p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+connectivity%22">Graph connectivity</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Graphs are widely used in fields like computer vision, pattern recognition, and bio-informatics to represent structural information. Graph matching is crucial for analyzing relationships and optimizing connections. A perfect matching pairs all vertices, essential for scenarios requiring complete pairing. In real-world systems, not all connections can be reversed. The generalized complement creates a new graph based on specific conditions, while the almost complement allows selective structural modifications instead of complete reversal. This flexibility aids in understanding complex relationships and provides solutions that other modeling methods may not achieve. This paper introduces the concept of almost generalized complements of a graph, focusing on the partitioning of the vertex set and perfect matching. It also explores the relationship between the almost k-complement and the almost k(i)-complement of a graph. Additionally, some important properties of almost generalized complements are discussed. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Engineering Letters is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=192025073 |
| RecordInfo | BibRecord: BibEntity: Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 5 StartPage: 862 Subjects: – SubjectFull: Graph theory Type: general – SubjectFull: Graph connectivity Type: general Titles: – TitleFull: Almost Generalized Complements of a Graph. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Amrithalakshmi – PersonEntity: Name: NameFull: D'Souza, Sabitha – PersonEntity: Name: NameFull: Nayak, Swati IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 03 Text: Mar2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 1816093X Numbering: – Type: volume Value: 34 – Type: issue Value: 3 Titles: – TitleFull: Engineering Letters Type: main |
| ResultId | 1 |
