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

On cyclic vertex-connectivity of Cartesian product digraphs

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

DOI10.1007/s10878-011-9395-1zbMath1282.90213OpenAlexW2138697537MaRDI QIDQ1928516

Zhao Zhang, Da Huang

Publication date: 3 January 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9395-1

zbMATH Keywords

cyclic vertex-connectivityCartesian product digraph


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)


Related Items

Augmenting weighted graphs to establish directed point-to-point connectivity, Restricted connectivity of total digraph



Cites Work

  • Unnamed Item
  • Cyclic arc-connectivity in a Cartesian product digraph
  • Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1928516&oldid=14356221"
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 16:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki