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

Regular number of a graph

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

DOI10.1080/09720529.2001.10697919zbMath0986.05061OpenAlexW2326238131MaRDI QIDQ2766134

Bidarahalli Janakiram, Radha R Iyer, Veerabhadra R. Kulli

Publication date: 27 January 2002

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2001.10697919


zbMATH Keywords

regular numberedge set independence number


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)


Related Items (3)

On the complexity of deciding whether the regular number is at most two ⋮ The regular number of a graph ⋮ Algorithmic complexity of weakly semiregular partitioning and the representation number




Cites Work

  • On Complementary Graphs




This page was built for publication: Regular number of a graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2766134&oldid=15648139"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 14:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki