ARSCOM 2008 - PDF Preprint Papers

ARSCOM 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ARSCOM-2008 Paper

click to vote

ARSCOM
2008

192views more ARSCOM 2008»

Bounds on the metric and partition dimensions of a graph

13 years 11 months ago

Download www.cs.uaf.edu

Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...

Glenn G. Chappell, John G. Gimbel, Chris Hartman

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	192	Bounds on the metric and partition dimensions of a graph	claim
2	153	Counting polyominoes with minimum perimeter	claim
3	133	Eccentricity sequences and eccentricity sets in digraphs	claim
4	119	Greedy Defining Sets in Latin Squares	claim
5	118	Proper Partitions of a Polygon and k-Catalan Numbers	claim
6	117	Subset Counting in Trees	claim
7	111	The Complexity of List Ranking of Trees	claim
8	110	Comment on "The Expectation Of Independent Domination Number Over Random Binary Trees"	claim
9	110	Total Perfect Codes in Tensor Products of Graphs	claim
10	103	Estimating the number of graphs containing very long induced paths	claim
11	98	New Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs	claim
12	85	Minimal blocking sets in PG(2, 9)	claim
13	82	Note on Coloring the Square of an Outerplanar Graph	claim
14	78	Three challenges in Costas arrays	claim
15	77	Generating Orthogonal Polynomials and their Derivatives using Vertex-Matching-Partitions of Graphs	claim
16	68	Group connectivity of certain graphs	claim
17	65	Strongly pan-factorial property in cages	claim
18	65	On the non-existence of a maximal partial spread of size 76 in PG(3, 9)	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers