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

Convex sets under some graph operations

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

DOI10.1007/s003730200065zbMath1009.05054OpenAlexW1981125614MaRDI QIDQ1865635

I. J. L. Garces, Sergio R. jun. Canoy

Publication date: 27 March 2003

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

Full work available at URL: https://doi.org/10.1007/s003730200065



Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)


Related Items

A note on the convexity number of the complementary prisms of trees ⋮ On the convexity number of graphs ⋮ A lower bound for the convexity number of some graphs ⋮ Convex sets in lexicographic products of graphs ⋮ Steiner convex sets and Cartesian product ⋮ Convex domination in the composition and cartesian product of graphs ⋮ Unnamed Item ⋮ On the geodetic number and related metric sets in Cartesian product graphs ⋮ On minimal geodetic domination in graphs ⋮ Outer-convex domination in graphs



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