The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In this paper we study some distance properties of outerplanar graphs with the Hamiltonian cycle whose all bounded faces are cycles isomorphic to the cycle C4. We call this family of graphs quadrangular outerplanar graphs. We give the lower and upper bound on the double branch weight and the status for this graphs. At the end of this paper we show some relations between median and double centroid in quadrangular outerplanar graphs
In this paper we study some distance properties of outerplanar graphs with the Hamiltonian cycle whose all bounded faces are cycles isomorphic to the cycle C4. We call this family of graphs quadrangular outerplanar graphs. We give the lower and upper bound on the double branch weight and the status for this graphs. At the end of this paper we show some relations between median and double centroid in quadrangular outerplanar graphs.
Let be a 3-uniform linear hypertree. We consider a blow-up hypergraph . We are interested in the following problem. We have to decide whether there exists a blow-up hypergraph of the hypertree , with hyperedge densities satisfying some conditions, such that the hypertree does not appear in a blow-up hypergraph as a transversal. We present an efficient algorithm to decide whether a given set of hyperedge densities ensures the existence of a 3-uniform linear hypertree in a blow-up hypergraph...
Download Results (CSV)