Coalition partitions of n-inordinate invariant intersection graphs

A class of algebraic intersection graphs, called the [Formula: see text]-inordinate invariant intersection graphs, has been introduced and various properties of these graphs are investigated in the literature. Domination is an important structural property in graphs and the notion of coalition in gr...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics, algorithms, and applications
Main Authors Madhumitha, S., Naduvath, Sudev
Format Journal Article
LanguageEnglish
Published 09.05.2025
Online AccessGet full text
ISSN1793-8309
1793-8317
DOI10.1142/S1793830925500739

Cover

Abstract A class of algebraic intersection graphs, called the [Formula: see text]-inordinate invariant intersection graphs, has been introduced and various properties of these graphs are investigated in the literature. Domination is an important structural property in graphs and the notion of coalition in graphs has been recently introduced based on different types of domination in graphs. In this article, we analyse the structure of the [Formula: see text]-inordinate invariant intersection graphs by investigating certain variants of domination based coalition partitions of them.
AbstractList A class of algebraic intersection graphs, called the [Formula: see text]-inordinate invariant intersection graphs, has been introduced and various properties of these graphs are investigated in the literature. Domination is an important structural property in graphs and the notion of coalition in graphs has been recently introduced based on different types of domination in graphs. In this article, we analyse the structure of the [Formula: see text]-inordinate invariant intersection graphs by investigating certain variants of domination based coalition partitions of them.
Author Madhumitha, S.
Naduvath, Sudev
Author_xml – sequence: 1
  givenname: S.
  orcidid: 0000-0001-7515-6518
  surname: Madhumitha
  fullname: Madhumitha, S.
– sequence: 2
  givenname: Sudev
  orcidid: 0000-0001-9692-4053
  surname: Naduvath
  fullname: Naduvath, Sudev
BookMark eNplkEtLAzEcxINUsNZ-AG_7BaLJJpvHURdfUPCgnpd_XhqpyZIEwW9vW8WLc5kfAzOHOUWLlJNH6JySC0p5f_lEpWaKEd0PAyGS6SO03EdYMSoXf0z0CVrX-k52GrhUUi_R9ZhhG1vMqZuhtAPVLocu4ZhycTFB811Mn1AipLaj5kv19tB4LTC_1TN0HGBb_frXV-jl9uZ5vMebx7uH8WqDLdW64R5AWG645dwHwj0LYJmxgybGaQdOKCcl90aIIBgooQxIQZ0m3mjWy4GtEP3ZtSXXWnyY5hI_oHxNlEz7H6Z_P7Bv8tFTVA
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1142/S1793830925500739
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1793-8317
ExternalDocumentID 10_1142_S1793830925500739
GroupedDBID 0R~
4.4
AAYXX
ADSJI
ALMA_UNASSIGNED_HOLDINGS
AMVHM
CITATION
EBS
HZ~
J9A
O9-
P71
RWJ
ID FETCH-LOGICAL-c199t-2aa6c4b4c44ef04e3fac3bc590bd9dad68d774eb66f63a868ba761d90eb932753
ISSN 1793-8309
IngestDate Tue Jul 01 04:55:31 EDT 2025
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c199t-2aa6c4b4c44ef04e3fac3bc590bd9dad68d774eb66f63a868ba761d90eb932753
ORCID 0000-0001-7515-6518
0000-0001-9692-4053
ParticipantIDs crossref_primary_10_1142_S1793830925500739
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2025-05-09
PublicationDateYYYYMMDD 2025-05-09
PublicationDate_xml – month: 05
  year: 2025
  text: 2025-05-09
  day: 09
PublicationDecade 2020
PublicationTitle Discrete mathematics, algorithms, and applications
PublicationYear 2025
SSID ssj0000547879
Score 2.3133955
SecondaryResourceType online_first
Snippet A class of algebraic intersection graphs, called the [Formula: see text]-inordinate invariant intersection graphs, has been introduced and various properties...
SourceID crossref
SourceType Index Database
Title Coalition partitions of n-inordinate invariant intersection graphs
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVEBS
  databaseName: EBSCOhost Mathematics Source - HOST
  customDbUrl:
  eissn: 1793-8317
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000547879
  issn: 1793-8309
  databaseCode: AMVHM
  dateStart: 20120601
  isFulltext: true
  titleUrlDefault: https://www.ebsco.com/products/research-databases/mathematics-source
  providerName: EBSCOhost
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PT9swFLZYe2GHicGm_YAph52oXILjuM4RClM1qVzaTr1V_pURaUtRSXvYX79nJ3UsCtK6ixXZjhX5S16-9-z3GaGvYOJUJgYx1gNJMDWEYpHnMbZKRwlPiSFOeH58x0Yz-n2ezrcHjTfZJZXsqz_P5pX8D6pQB7jaLNk9kPWDQgVcA75QAsJQ_hPGw6Vl0RbAB9vqN7WVuCjBqSxKIJK9otyAPwwT6KQhVo-mPhzcKVU_htz0pgATAhy699tLuTqQxa-fy1VR3ddBGSfuGqx6tyFtfb-2YRrHRid9H2UWer0RdfRmstZmE8YZSOp29WWBaYQvGfOkqTJhXZ19uWuMqRV3ndhO9j5wXty6YPvn2a62P_kh-W2CddI0WewM8Qp1CVjxuIO6V-Mfo7GPqsVWnswJLPrHbZayYZyLnXECMhKwiukRetO4A9FVje1bdGDKY_R63AJwgq49ylGLcrTMoxDlyKMchShHNcrv0Ozb7XQ4ws3JF1hdZlmFiRBMUUkVpSaPqUlyoRKp0iyWOtNCM66BthvJWM4SwRmXYsAudRYbCXwcPND3qFMuS_MBRSrXUlEWc8MJFcxkklsXVBjBU2jjH9H5dgoWD7XAyeLFef-0T-fP6LB9j05Rp1qtzRkwuEp-aWD7C6-jQ_E
linkProvider EBSCOhost
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Coalition+partitions+of+n-inordinate+invariant+intersection+graphs&rft.jtitle=Discrete+mathematics%2C+algorithms%2C+and+applications&rft.au=Madhumitha%2C+S.&rft.au=Naduvath%2C+Sudev&rft.date=2025-05-09&rft.issn=1793-8309&rft.eissn=1793-8317&rft_id=info:doi/10.1142%2FS1793830925500739&rft.externalDBID=n%2Fa&rft.externalDocID=10_1142_S1793830925500739
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1793-8309&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1793-8309&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1793-8309&client=summon